Generating all 4-regular planar graphs from the graph of the octahedron

DOI10.1002/jgt.3190050412zbMath0474.05058OpenAlexW2113775363MaRDI QIDQ3929775

Jenő Lehel

Publication date: 1981

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190050412

zbMATH Keywords

4-regular graphgraph generation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (9)

Polychromatic 4-coloring of cubic even embeddings on the projective plane ⋮ Enumeration of labeled 4-regular planar graphs ⋮ Generating \(r\)-regular graphs ⋮ Split Euler tours in 4-regular planar graphs ⋮ An inductive definition of the class of 3-connected quadrangulations of the plane ⋮ Recursive Generation of 5-Regular Planar Graphs ⋮ Generating 5-regular planar graphs ⋮ Regular non-Hamiltonian polyhedral graphs ⋮ Generation of simple quadrangulations of the sphere

This page was built for publication: Generating all 4-regular planar graphs from the graph of the octahedron