Nice pairs of disjoint pentagons in fullerene graphs

DOI10.1007/S10910-021-01242-6MaRDI QIDQ830887zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Nice pairs of odd cycles in fullerene graphs
• Nice pairs of pentagons in chamfered fullerenes
• 2-resonant fullerenes
• On some structural properties of generalized fullerene graphs with 13 pentagonal faces
• On the 2-resonance of fullerenes

Cites work

• scientific article; zbMATH DE number 3544865 (Why is no real title available?)
• 2-resonant fullerenes
• A note on the cyclical edge-connectivity of fullerene graphs
• An upper bound for the Clar number of fullerene graphs
• Cyclic 7-edge-cuts in fullerene graphs
• Cyclic edge-cuts in fullerene graphs
• Cyclical edge-connectivity of fullerene graphs and (k,6)-cages
• Extremal fullerene graphs with the maximum Clar number
• Fullerene graphs have exponentially many perfect matchings
• Graph theory
• How to build a brick
• Matching theory
• Maximum matching and a polyhedron with 0,1-vertices
• New lower bound on the number of perfect matchings in fullerene graphs
• Nice pairs of odd cycles in fullerene graphs
• On k-resonant fullerene graphs
• On cyclic edge-connectivity of fullerenes
• On some structural properties of fullerene graphs
• On the 2-resonance of fullerenes
• On the anti-forcing number of fullerene graphs
• The Factorization of Linear Graphs
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• The isolated-pentagon rule and nice substructures in fullerenes
• The perfect matching polytope and solid bricks
• \(k\)-resonance of open-ended carbon nanotubes

Cited in

(3)

• Nice pairs of odd cycles in fullerene graphs
• Nice pairs of pentagons in chamfered fullerenes
• PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830887)