Nice pairs of disjoint pentagons in fullerene graphs

DOI10.1007/s10910-021-01242-6zbMath1466.92295OpenAlexW3137529278MaRDI QIDQ830887

N. E. Zubov

Publication date: 10 May 2021

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

Full work available at URL: https://doi.org/10.1007/s10910-021-01242-6

zbMATH Keywords

perfect matchingfullerene graphBirkhoff-von Neumann graphdisjoint pentagonsnice subgraph

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• The perfect matching polytope and solid bricks
• Nice pairs of odd cycles in fullerene graphs
• Fullerene graphs have exponentially many perfect matchings
• Cyclic 7-edge-cuts in fullerene graphs
• A note on the cyclical edge-connectivity of fullerene graphs
• Cyclic edge-cuts in fullerene graphs
• On cyclic edge-connectivity of fullerenes
• Extremal fullerene graphs with the maximum Clar number
• An upper bound for the Clar number of fullerene graphs
• Matching theory
• 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
• 2-resonant fullerenes
• How to build a brick
• On the 2-Resonance of Fullerenes
• Onk-Resonant Fullerene Graphs
• The isolated-pentagon rule and nice substructures in fullerenes
• On the anti-forcing number of fullerene graphs
• Maximum matching and a polyhedron with 0,1-vertices
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• The Factorization of Linear Graphs

This page was built for publication: Nice pairs of disjoint pentagons in fullerene graphs