Generating 5-regular planar graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
- A characterization of 3-connected graphs containing a given graph
- A generating theorem for 5-regular simple planar graphs. I
- Decomposition of regular matroids
- Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
- Generating all 4-regular planar graphs from the graph of the octahedron
- Generating all planer graphs regular of degree four
- Generating the \(c^*5\)-connected graphs
- On generating planar graphs
- Splitter Theorems for Cubic Graphs
- Splitter theorems for 4-regular graphs
Cited in
(8)- Construction of 4-Regular Graphs
- scientific article; zbMATH DE number 1751593 (Why is no real title available?)
- Recursive generation of simple planar 5-regular graphs and pentangulations
- A generating theorem for 5-regular simple planar graphs. I
- Hamiltonian cycles and 1-factors in 5-regular graphs
- Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
- A census of all 5-regular planar graphs with diameter 3.
- Recursive Generation of 5-Regular Planar Graphs
This page was built for publication: Generating 5-regular planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652532)