On lower bounds of number of perfect matchings in fullerene graphs

DOI10.1023/A:1019195324778zbMath0918.92025OpenAlexW187862351MaRDI QIDQ1280057

Tomislav Došlić

Publication date: 7 July 1999

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

Full work available at URL: https://doi.org/10.1023/a:1019195324778

zbMATH Keywords

decompositionperfect matchingsfullerene graph

Mathematics Subject Classification ID

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

Related Items (29)

Nice pairs of odd cycles in fullerene graphs ⋮ Packing stars in fullerenes ⋮ Finding more perfect matchings in leapfrog fullerenes ⋮ Fullerene graphs have exponentially many perfect matchings ⋮ The fullerene graphs with a perfect star packing ⋮ Cyclic 7-edge-cuts in fullerene graphs ⋮ Global forcing number of benzenoid graphs ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ 𝐵-rigidity of the property to be an almost Pogorelov polytope ⋮ Polyhedral graphs via their automorphism groups ⋮ Models of virus capsids containing 72 pentameric capsomeres ⋮ Distance-restricted matching extendability of fullerene graphs ⋮ A note on the cyclical edge-connectivity of fullerene graphs ⋮ On the automorphism group of polyhedral graphs ⋮ Saturation number of fullerene graphs ⋮ On bicriticality of (3,6)-fullerene graphs ⋮ Leapfrog fullerenes have many perfect matchings ⋮ Cyclic edge-cuts in fullerene graphs ⋮ Theory of families of polytopes: fullerenes and Pogorelov polytopes ⋮ On cyclic edge-connectivity of fullerenes ⋮ Long cycles in fullerene graphs ⋮ On some structural properties of generalized fullerene graphs with 13 pentagonal faces ⋮ Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions ⋮ The k-conversion number of regular graphs ⋮ Fullerene graphs with exponentially many perfect matchings ⋮ On decompositions of leapfrog fullerenes ⋮ Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes ⋮ Cohomological rigidity of families of manifolds associated with ideal right-angled hyperbolic 3-polytopes ⋮ 2-resonant fullerenes

This page was built for publication: On lower bounds of number of perfect matchings in fullerene graphs