The number of matchings of low order in hexagonal systems

Discrete Mathematics

Volumn 186, Issue 1-3, 1998, Pages 167-175

  Klabjan, Diego ^a,b   Mohar, B ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043286570     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00163-5     Document Type: Article

References (7)

1. K. Al-Khnaifes, H. Sachs, Graphs, linear equations, determinants, and the number of perfect matchings, in: R. Bodendiek (Ed.), Contemporary Methods in Graph Theory, BI-Wissenschaftsverlag, Mannheim, Wien, Zuerich, 1990, pp. 47-71.
2. D.M. Cvetković, M. Doob, H. Sachs, Spectra of Graphs, Academic Press, New York, 1979.
3. I. Gutman, S. Petrović, B. Mohar, Topological properties of benzenoid systems, XX. Matching polynomials and topological resonance energies of cata-condensed benzenoid hydrocarbons, Collection Sci. Papers Fac. Sci. Kragujevac 3 (1982) 43-90.
4. I. Gutman, S. Petrović, B. Mohar, Topological properties of benzenoid systems, XXa. Matching polynomials and topological resonance energies of peri-condensed benzenoid hydrocarbons, Collection Sci. Papers Fac. Sci. Kragujevac 4 (1983) 189-225.
5. P. Hansen, M. Zheng, A linear algorithm for perfect matching in hexagonal systems, Discrete Math. 122 (1993) 179-196.
6. P. John, H. Sachs, H. Zernitz, Counting perfect matchings in polyominoes with the application to the dimer problem, Zastos. Mat. Appl. Math. XIX (1987) 465-477.
7. H. Sachs, Counting Perfect Matchings in Lattice Graphs, in: Topics in Combinatorics and Graph Theory, Physica-Verlag, Heidelberg, 1990.