Deltahedra are realizable as simplicial convex polyhedra

DOI10.1016/0166-218X(80)90058-XzbMath0434.05027OpenAlexW1987663013MaRDI QIDQ1139597

Jenő Lehel

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(80)90058-x

zbMATH Keywords

deltahedronmaximal planar graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx)

Related Items (1)

Decomposition of 3-connected cubic graphs

Cites Work

• Construction properties of combinatorial deltahedra
• Unnamed Item
• Unnamed Item

This page was built for publication: Deltahedra are realizable as simplicial convex polyhedra