Recursive generation of simple planar 5-regular graphs and pentangulations

DOI10.7155/JGAA.00232MaRDI QIDQ2865033zbMATH OpenOpenAlexFDO

Authors Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves

Publication date 28 November 2013

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00232

zbMATH Keywords

starting graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Recursive Generation of 5-Regular Planar Graphs
• A generating theorem for 5-regular simple planar graphs. I
• Generating 5-regular planar graphs
• Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
• Fast generation of planar graphs

Cited in

(15)

• Some results on double triangle descendants of \(K_5\)
• Regular non-Hamiltonian polyhedral graphs
• Stable and dynamic minimum cuts
• Fan-planar graphs
• scientific article; zbMATH DE number 1751593 (Why is no real title available?)
• Facial rainbow edge-coloring of simple 3-connected plane graphs
• Locally recoverable codes from planar graphs
• A generating theorem for 5-regular simple planar graphs. I
• Hamiltonian cycles and 1-factors in 5-regular graphs
• Generation of 3-connected, planar line graphs
• \(k\)-planar graphs
• On optimal beyond-planar graphs
• Recursive Generation of 5-Regular Planar Graphs
• Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
• Generating 5-regular planar graphs

This page was built for publication: Recursive generation of simple planar 5-regular graphs and pentangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865033)