A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs
From MaRDI portal
Publication:423951
DOI10.1016/j.dam.2011.12.030zbMath1239.05105OpenAlexW1998799246MaRDI QIDQ423951
Publication date: 30 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.030
Applications of graph theory (05C90) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
- Maximal resonance of cubic bipartite polyhedral graphs
- \(k\)-resonant toroidal polyhexes
- Matching theory
- On minimal elementary bipartite graphs
- \(k\)-cycle resonant graphs
- Planar \(k\)-cycle resonant graphs with \(k=1,2\)
- Plane elementary bipartite graphs
- \(k\)-resonance in toroidal polyhexes
- Onk-Resonant Fullerene Graphs
This page was built for publication: A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs