On cyclic edge-connectivity of fullerenes

DOI10.1016/j.dam.2007.08.046zbMath1152.05341arXivmath/0702511OpenAlexW1989853774MaRDI QIDQ944718

Klavdija Kutnar, Dragan Marušič

Publication date: 10 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0702511

zbMATH Keywords

graphperfect matchingHamilton cyclecyclic edge-connectivityfullerene graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)

Related Items (27)

The anti-Kekulé number of graphs ⋮ Nice pairs of disjoint pentagons in fullerene graphs ⋮ Nice pairs of odd cycles in fullerene graphs ⋮ Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Finding more perfect matchings in leapfrog fullerenes ⋮ Shortest perfect pseudomatchings in fullerene graphs ⋮ Cyclic 7-edge-cuts in fullerene graphs ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes ⋮ Decomposition of cubic graphs with cyclic connectivity 5 ⋮ Characterizing the fullerene graphs with the minimum forcing number 3 ⋮ Polyhedral graphs via their automorphism groups ⋮ A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs ⋮ Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs ⋮ The cubic graphs with finite cyclic vertex connectivity larger than girth ⋮ The isolated-pentagon rule and nice substructures in fullerenes ⋮ On the automorphism group of polyhedral graphs ⋮ Theory of families of polytopes: fullerenes and Pogorelov polytopes ⋮ On the sextet polynomial of fullerenes ⋮ Forcing matching numbers of fullerene graphs ⋮ Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs ⋮ Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions ⋮ A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian ⋮ On decompositions of leapfrog fullerenes ⋮ Packing resonant hexagons in fullerenes ⋮ Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes ⋮ 2-resonant fullerenes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6
• Kekulé structures and the face independence number of a fullerene
• A note on the cyclical edge-connectivity of fullerene graphs
• Fullerene graphs with exponentially many perfect matchings
• Uniform cyclic edge connectivity in cubic graphs
• Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
• On lower bounds of number of perfect matchings in fullerene graphs
• Parallel concepts in graph theory
• A cyclically 6-edge-connected snark of order 118
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• Fullerenes and coordination polyhedra versus half-cube embeddings
• New lower bound on the number of perfect matchings in fullerene graphs
• On some structural properties of fullerene graphs
• Constructing fullerene graphs from their eigenvalues and angles
• The independence numbers of fullerenes and benzenoids
• Construction of planar triangulations with minimum degree 5
• Encoding Fullerenes and Geodesic Domes
• Nonhamiltonian 3-Connected Cubic Planar Graphs
• A completely unambiguous 5-polyhedral graph
• Four-dimensional football, fullerenes and diagram geometry

This page was built for publication: On cyclic edge-connectivity of fullerenes