Cyclic edge-cuts in fullerene graphs
From MaRDI portal
Publication:937688
DOI10.1007/s10910-007-9296-9zbMath1145.92038MaRDI QIDQ937688
František Kardoš, Riste Škrekovski
Publication date: 15 August 2008
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-007-9296-9
05C90: Applications of graph theory
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
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, Fullerenes with the maximum Clar number, Atoms of cyclic edge connectivity in regular graphs, Bipartizing fullerenes, Sums of powers of the degrees of graphs with \(k\) cut edges, The anti-Kekulé number of graphs, Nice pairs of disjoint pentagons in fullerene graphs, Nice pairs of odd cycles in fullerene graphs, Fullerene graphs have exponentially many perfect matchings, Cyclic 7-edge-cuts in fullerene graphs, On the sextet polynomial of fullerenes, Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face, Theory of families of polytopes: fullerenes and Pogorelov polytopes, Shortest perfect pseudomatchings in fullerene graphs, Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions, 2-resonant fullerenes, Super cyclically edge-connected vertex-transitive graphs of girth at least 5, Super-cyclically edge-connected regular graphs, Characterizing the fullerene graphs with the minimum forcing number 3, Exact square coloring of subcubic planar graphs, Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
Cites Work
- On the number of Kekulé structures in capped zigzag nanotubes
- On lower bounds of number of perfect matchings in fullerene graphs
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- \(k\)-resonance of open-ended carbon nanotubes
- New lower bound on the number of perfect matchings in fullerene graphs
- On some structural properties of fullerene graphs
- The independence numbers of fullerenes and benzenoids
