Recursive Generation of 5-Regular Planar Graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 15463 (Why is no real title available?)
- scientific article; zbMATH DE number 3545706 (Why is no real title available?)
- scientific article; zbMATH DE number 3575612 (Why is no real title available?)
- A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
- A generating theorem for 5-regular simple planar graphs. I
- Construction of planar triangulations with minimum degree 5
- Fast generation of planar graphs
- Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
- Generating all 4-regular planar graphs from the graph of the octahedron
- Isomorph-Free Exhaustive Generation
Cited in
(6)- scientific article; zbMATH DE number 1751593 (Why is no real title available?)
- The planar Turán number of double stars \(S_{2,l}\)
- Recursive generation of simple planar 5-regular graphs and pentangulations
- A generating theorem for 5-regular simple planar graphs. I
- A census of all 5-regular planar graphs with diameter 3.
- Generating 5-regular planar graphs
This page was built for publication: Recursive Generation of 5-Regular Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605492)