2-resonant fullerenes
From MaRDI portal
Publication:2349955
DOI10.1016/j.ejc.2015.02.025zbMath1315.05040arXiv1211.5640OpenAlexW2034143886MaRDI QIDQ2349955
Publication date: 18 June 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.5640
Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (2)
Cites Work
- Unnamed Item
- Hexagonal resonance of (3,6)-fullerenes
- 2-extendability and \(k\)-resonance of non-bipartite Klein-bottle polyhexes
- 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
- 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
- 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
- On the 2-Resonance of Fullerenes
- Onk-Resonant Fullerene Graphs
- The Factorization of Linear Graphs
This page was built for publication: 2-resonant fullerenes