Recursive generation of simple planar 5-regular graphs and pentangulations

DOI10.7155/JGAA.00232zbMATH Open1276.05033OpenAlexW2067121159MaRDI QIDQ2865033FDOQ2865033

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)

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

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

zbMATH Keywords

starting graphs

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• 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
• Generating 5-regular planar graphs
• Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4

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)