Fullerene graphs with exponentially many perfect matchings

DOI10.1007/s10910-006-9068-yzbMath1175.05109MaRDI QIDQ1025756

Tomislav Došlić

Publication date: 23 June 2009

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

Full work available at URL: https://doi.org/10.1007/s10910-006-9068-y

zbMATH Keywords

enumeration; perfect matching; fullerene graph; icosahedral fullerene

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C10: Planar graphs; geometric and topological aspects 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.)

Related Items

Nice pairs of odd cycles in fullerene graphs, Finding more perfect matchings in leapfrog fullerenes, Fullerene graphs have exponentially many perfect matchings, Leapfrog fullerenes have many perfect matchings, On cyclic edge-connectivity of fullerenes, Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems, On the automorphism group of polyhedral graphs, A mathematical programming model for computing the fries number of a fullerene, Packing resonant hexagons in fullerenes, Polyhedral graphs via their automorphism groups, Counting perfect matchings in \(n\)-extendable graphs, On Certain Graph Theory Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of Kekulé structures in capped zigzag nanotubes
• On lower bounds of number of perfect matchings in fullerene graphs
• 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 bipartite lattice animals: lower bounds and realizability
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra