An inequality for 3-polytopes

DOI10.1016/0095-8956(87)90037-2zbMath0576.05021OpenAlexW2009654165MaRDI QIDQ1065016

Jean-Pierre Roudneff

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)90037-2

zbMATH Keywords

tilings3-dimensional polytope3-connected planar graphEuler's relation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Polytopes and polyhedra (52Bxx)

Related Items (1)

Inner diagonals of convex polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of hexagons in a map
• On p-vectors of 3-polytopes

This page was built for publication: An inequality for 3-polytopes