Generating planar 4-connected graphs

DOI10.1007/BF02761529zbMath0254.05104OpenAlexW1979658162MaRDI QIDQ2558317

D. W. Barnette

Publication date: 1973

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02761529

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05Cxx)

Related Items

Generating the centrally symmetric 3-polyhedral graphs ⋮ A classification of 4-connected graphs ⋮ Soldering and point splitting ⋮ Generating closed 2-cell embeddings in the torus and the projective plane ⋮ Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane ⋮ 5-connected 3-polytopes are refinements of octahedra

Cites Work

• On the graph structure of convex polyhedra in \(n\)-space
• Unnamed Item
• Unnamed Item