Recursive Generation of 5-Regular Planar Graphs

DOI10.1007/978-3-642-00202-1_12zbMath1211.05164OpenAlexW1486761531MaRDI QIDQ3605492

Mahdieh Hasheminezhad, Tristan Reeves, Brendan D. McKay

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1885/52657

zbMATH Keywords

graphplanarmapquinticpentangulation5-regular5-valent

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• plantri

Cites Work

• Construction of planar triangulations with minimum degree 5
• Generating all 4-regular planar graphs from the graph of the octahedron
• Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
• Isomorph-Free Exhaustive Generation
• A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive Generation of 5-Regular Planar Graphs