An inequality for 3-polytopes

DOI10.1016/0095-8956(87)90037-2MaRDI QIDQ1065016zbMATH OpenOpenAlexFDO

Authors 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-connected planar graph3-dimensional polytopeEuler's relation

Mathematics Subject Classification ID

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

Recommendations

• An inequality concerning edges of minor weight in convex 3-polytopes
• Description of faces in 3-polytopes without vertices of degree from 4 to 9
• Low faces of restricted degree in 3-polytopes
• Describing faces in 3-polytopes with no vertices of degree from 5 to 7
• The height of faces of 3-polytopes

Cites work

• scientific article; zbMATH DE number 3722672 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• On p-vectors of 3-polytopes
• On the number of hexagons in a map

Cited in

(5)

• Linear inequalities for rank 3 geometric lattices
• 68.25 A tetrahedron inequality
• An inequality concerning edges of minor weight in convex 3-polytopes
• A structural property of convex 3-polytopes
• Inner diagonals of convex polytopes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065016)