On some structural properties of fullerene graphs

DOI10.1023/A:1016274815398zbMath0994.05128MaRDI QIDQ1614157

Tomislav Došlić

Publication date: 3 September 2002

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

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

zbMATH Keywords

enumeration; fullerenes; perfect matchings; fullerene graphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

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

05C75: Structural characterization of families of graphs

05C40: Connectivity

Related Items

The isolated-pentagon rule and nice substructures in fullerenes, Long cycles in fullerene graphs, A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing, 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, Cyclic 7-edge-cuts in fullerene graphs, A note on the cyclical edge-connectivity of fullerene graphs, Saturation number of fullerene graphs, Leapfrog fullerenes have many perfect matchings, Cyclic edge-cuts in fullerene graphs, On cyclic edge-connectivity of fullerenes, Fullerene graphs with exponentially many perfect matchings, On decompositions of leapfrog fullerenes, On the automorphism group of polyhedral graphs, On bicriticality of (3,6)-fullerene graphs, Restricted 2-extendability of (3,6)-fullerenes, The density of fan-planar 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, 2-resonant fullerenes, Computing the bipartite edge frustration of fullerene graphs, Polyhedral graphs via their automorphism groups