New lower bound on the number of perfect matchings in fullerene graphs

Journal of Mathematical Chemistry

Volumn 30, Issue 3, 2001, Pages 343-347

  Zhang, Heping ^a   Zhang, Fuji ^b  

^a LANZHOU UNIVERSITY   (China)

^b XIAMEN UNIVERSITY   (China)

Author keywords

2 extendable graph; Bicritical graph; Fullerene; Kekul ; Perfect matching; Structure

Indexed keywords

EID: 0035471115     PISSN: 02599791     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015131912706     Document Type: Article

References (11)

1. 70, Chem. Phys. Letters 234 (1995) 240-244.
2. G. Brinkmann and A. Dress, A constructive enumeration of fullerenes, J. Algorithms 23 (1997) 345-358.
3. T. Došlić, On lower bounds of number of perfect matchings in fullerene graphs, J. Math. Chem. 24 (1998) 359-364.
4. P. W. Fowler, T. Pisanski, A. Graovac and J. Žerovnik, A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra, in: Discrete Mathematical Chemistry, eds. P. Hansen, P. Fowler and M. Zheng, DIMACS, Vol. 51 (2000) pp. 175-187.
5. P. W. Fowler and D.E. Manolopoulos, An Atlas of Fullerenes (Oxford Univ. Press, Oxford, 1995).
6. D.J. Klein and X. Liu, J. Math. Chem. 11 (1992) 199.
7. 60: Buckminsterfullerene, Nature 318 (1985) 162-163.
8. D.A. Holton and M.D. Plummer, 2-extendability in 3-polytopes, in: Combinatorics, Eger, Hungary, 1987, Colloq. Math. Soc. J. Bolyai, Vol. 52 (Akadémiai Kiadó, Budapest, 1988) pp. 281-300.
9. L. Lovász and M.D. Plummer, Matching Theory, Annals of Discrete Math., Vol. 29 (North-Holland, Amsterdam, 1986).
10. J. Peterson, Die Theorie der regulären Graphen, Acta Math. 15 (1891) 193-220.
11. M. D. Plummer, Extending matchings in graphs: An update, Congr. Numerantium 116 (1996) 3-32.