Nice pairs of disjoint pentagons in fullerene graphs
From MaRDI portal
Publication:830887
DOI10.1007/S10910-021-01242-6zbMATH Open1466.92295OpenAlexW3137529278MaRDI QIDQ830887FDOQ830887
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
Recommendations
Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Graph theory
- Matching theory
- Title not available (Why is that?)
- The Factorization of Linear Graphs
- Maximum matching and a polyhedron with 0,1-vertices
- An upper bound for the Clar number of fullerene graphs
- On \(k\)-resonant fullerene graphs
- Extremal fullerene graphs with the maximum Clar number
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- On some structural properties of fullerene graphs
- The perfect matching polytope and solid bricks
- Cyclic 7-edge-cuts in fullerene graphs
- Cyclic edge-cuts in fullerene graphs
- On cyclic edge-connectivity of fullerenes
- \(k\)-resonance of open-ended carbon nanotubes
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
- Fullerene graphs have exponentially many perfect matchings
- How to build a brick
- On the anti-forcing number of fullerene graphs
- New lower bound on the number of perfect matchings in fullerene graphs
- 2-resonant fullerenes
- On the 2-resonance of fullerenes
- The isolated-pentagon rule and nice substructures in fullerenes
- Nice pairs of odd cycles in fullerene graphs
- A note on the cyclical edge-connectivity of fullerene graphs
Cited In (1)
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)
