Generating all 3‐connected 4‐regular planar graphs from the octahedron graph

DOI10.1002/jgt.3190170508zbMath0781.05047MaRDI QIDQ4271618

No author found.

Publication date: 30 January 1994

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

Full work available at URL: https://research.utwente.nl/en/publications/generating-all-3connected-4regular-planar-graphs-from-the-octahedron-graph(9027937b-9128-4382-b4c6-14cb9b1d23a6).html

zbMATH Keywords

3-connected 4-regular planar graphs; octahedron graph

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

05C99: Graph theory

Related Items

Generating polyhedral quadrangulations of the projective plane, Unnamed Item, The segment number: algorithms and universal lower bounds for some classes of planar graphs, Polychromatic 4-coloring of cubic even embeddings on the projective plane, Split Euler tours in 4-regular planar graphs, Generating \(r\)-regular graphs, Enumeration of labeled 4-regular planar graphs, Regular non-Hamiltonian polyhedral graphs, Generation of simple quadrangulations of the sphere, Recursive Generation of 5-Regular Planar Graphs, Generating 5-regular planar graphs

Cites Work

• Unnamed Item
• A Census of Planar Maps