Generating 5-regular planar graphs
From MaRDI portal
Publication:3652532
DOI10.1002/jgt.20377zbMath1221.05078OpenAlexW4253091492MaRDI QIDQ3652532
Guoli Ding, Jinko Kanno, Jianning Su
Publication date: 18 December 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20377
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition of regular matroids
- A characterization of 3-connected graphs containing a given graph
- Generating the \(c^*5\)-connected graphs
- Splitter theorems for 4-regular graphs
- On generating planar graphs
- Generating all planer graphs regular of degree four
- Generating all 4-regular planar graphs from the graph of the octahedron
- Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
- Splitter Theorems for Cubic Graphs
- A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
This page was built for publication: Generating 5-regular planar graphs