论文信息 - Forcing matchings on square grids - 字舞流文

Forcing matchings on square grids

Lior Pachter | Peter Kim | L. Pachter | Peter Kim

[1] C. Lucchesi,et al. A Minimax Theorem for Directed Graphs , 1978 .

[2] N. Trinajstic. Mathematical and computational concepts in chemistry , 1986 .

[3] M. Randic,et al. Innate degree of freedom of a graph , 1987 .

[4] Fuji Zhang,et al. Z-transformation graphs of perfect matchings of hexagonal systems , 1988, Discret. Math..

[5] F. Harary,et al. Graphical properties of polyhexes: Perfect matching vector and forcing , 1991 .

[6] Klein,et al. Topological long-range order for resonating-valence-bond structures. , 1991, Physical review. B, Condensed matter.

[7] G. C. Shephard,et al. Pick's theorem , 1993 .

[8] Jean Fonlupt,et al. Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs , 1994, SIAM J. Discret. Math..

[9] Harold N. Gabow. Centroids, Representations, and Submodular Flows , 1995, J. Algorithms.

[10] Xueliang Li,et al. Hexagonal systems with forcing edges , 1995, Discret. Math..

[11] Noga Alon,et al. Edge-disjoint cycles in regular directed graphs , 1996, J. Graph Theory.

[12] Mihai Ciucu,et al. Enumeration of Perfect Matchings in Graphs with Reflective Symmetry , 1997, J. Comb. Theory, Ser. A.