On cyclic edge-connectivity of fullerenes
From MaRDI portal
Publication:944718
DOI10.1016/j.dam.2007.08.046zbMath1152.05341arXivmath/0702511MaRDI 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
05C90: Applications of graph theory
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
05C40: Connectivity
Related Items
The isolated-pentagon rule and nice substructures in fullerenes, Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes, A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian, Cyclic Vertex (Edge) Connectivity of Burnt Pancake Graphs, The anti-Kekulé number of graphs, Nice pairs of disjoint pentagons in fullerene graphs, Nice pairs of odd cycles in fullerene graphs, Finding more perfect matchings in leapfrog fullerenes, Cyclic 7-edge-cuts in fullerene graphs, On the sextet polynomial of fullerenes, Forcing matching numbers of fullerene graphs, On decompositions of leapfrog fullerenes, Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face, On the automorphism group of polyhedral graphs, Theory of families of polytopes: fullerenes and Pogorelov polytopes, Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs, Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs, Shortest perfect pseudomatchings in fullerene graphs, Decomposition of cubic graphs with cyclic connectivity 5, The cubic graphs with finite cyclic vertex connectivity larger than girth, Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions, Packing resonant hexagons in fullerenes, 2-resonant fullerenes, Polyhedral graphs via their automorphism groups, A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs, Characterizing the fullerene graphs with the minimum forcing number 3, Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
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
