5-connected 3-polytopes are refinements of octahedra

DOI10.1016/0095-8956(87)90042-6zbMath0582.05052OpenAlexW1972897930MaRDI QIDQ1068856

D. W. Barnette

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90042-6

zbMATH Keywords

octahedron3-polytope5-connected graphdischarging techniques

Mathematics Subject Classification ID

Graph theory (05C99) Polytopes and polyhedra (52Bxx)

Cites Work

• Every planar map is four colorable. I: Discharging
• Generating planar 4-connected graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: 5-connected 3-polytopes are refinements of octahedra