Fullerene graphs have exponentially many perfect matchings

DOI10.1007/s10910-008-9471-7zbMath1196.92053arXiv0801.1438WikidataQ57601462 ScholiaQ57601462MaRDI QIDQ839387

Daniel Král', František Kardoš, Jean-Sébastien Sereni, Jozef Miškuf

Publication date: 2 September 2009

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.1438

zbMATH Keywords

perfect matching; fullerene; fullerene graph

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

05C40: Connectivity

Related Items

Long cycles in fullerene graphs, Bipartizing fullerenes, Exponentially many perfect matchings in cubic graphs, On some structural properties of generalized fullerene graphs with 13 pentagonal faces, Packing resonant hexagons in fullerenes, 2-resonant fullerenes

Cites Work

• Leapfrog fullerenes have many perfect matchings
• Cyclic edge-cuts in fullerene graphs
• Fullerene graphs with exponentially many perfect matchings
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• On lower bounds of number of perfect matchings in fullerene graphs
• The four-colour theorem
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• New lower bound on the number of perfect matchings in fullerene graphs
• On some structural properties of fullerene graphs
• Perfect matchings in planar cubic graphs