Fullerene graphs have exponentially many perfect matchings

DOI10.1007/S10910-008-9471-7MaRDI QIDQ839387zbMATH OpenOpenAlexWikidataFDO

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

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

fullerenefullerene graphperfect matching

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Abstract: A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings.

Cites work

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

Cited in

(21)

• Fullerene graphs with exponentially many perfect matchings
• On lower bounds of number of perfect matchings in fullerene graphs
• Distance-restricted matching extendability of fullerene graphs
• Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
• Shortest perfect pseudomatchings in fullerene graphs
• On some structural properties of generalized fullerene graphs with 13 pentagonal faces
• A mathematical programming model for computing the fries number of a fullerene
• Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions
• Packing resonant hexagons in fullerenes
• 2-resonant fullerenes
• Bipartizing fullerenes
• Zigzag Structures of Simple Two-Faced Polyhedra
• On the growth rate of the number of fullerenes
• Exponentially many perfect matchings in cubic graphs
• Long cycles in fullerene graphs
• Tight upper bounds for the p-anionic Clar number of fullerenes
• Clar and Fries structures for fullerenes
• Nice vertices in cubic graphs
• The AVD-total chromatic number of fullerene molecular graphs
• Nice pairs of disjoint pentagons in fullerene graphs
• Nice pairs of odd cycles in fullerene graphs

This page was built for publication: Fullerene graphs have exponentially many perfect matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839387)