New lower bound on the number of perfect matchings in fullerene graphs
From MaRDI portal
Publication:1600673
DOI10.1023/A:1015131912706zbMath1003.92039MaRDI QIDQ1600673
Publication date: 16 June 2002
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
The anti-Kekulé number of graphs, Nice pairs of disjoint pentagons in fullerene graphs, 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, Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs, Distance-restricted matching extendability of fullerene graphs, A note on the cyclical edge-connectivity of fullerene graphs, The isolated-pentagon rule and nice substructures in fullerenes, Saturation number of fullerene graphs, On bicriticality of (3,6)-fullerene graphs, Leapfrog fullerenes have many perfect matchings, Cyclic edge-cuts in fullerene graphs, On cyclic edge-connectivity of fullerenes, Long cycles in fullerene graphs, 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes, Forcing matching numbers of fullerene graphs, A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs, On some structural properties of generalized fullerene graphs with 13 pentagonal faces, Restricted 2-extendability of (3,6)-fullerenes, On Certain Graph Theory Applications, Fullerenes with the maximum Clar number, 2-extendability of toroidal polyhexes and Klein-bottle polyhexes, Fullerene graphs with exponentially many perfect matchings, On decompositions of leapfrog fullerenes, 2-resonant fullerenes
