On some structural properties of fullerene graphs
From MaRDI portal
Publication:1614157
DOI10.1023/A:1016274815398zbMath0994.05128MaRDI QIDQ1614157
Publication date: 3 September 2002
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
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
Long cycles in fullerene graphs, A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing, 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 some structural properties of generalized fullerene graphs with 13 pentagonal faces, 2-resonant fullerenes, Computing the bipartite edge frustration of fullerene graphs
