On p-vectors of 3-polytopes

DOI10.1016/S0021-9800(69)80042-6zbMATH Open0179.25902OpenAlexW2058724874MaRDI QIDQ5570036FDOQ5570036

D. W. Barnette

Publication date: 1969

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

Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80042-6

zbMATH Keywords

elementary geometry

Cited In (11)

• Upper bounds on the sum of powers of the degrees of a simple planar graph
• Title not available (Why is that?)
• An Eberhard-like theorem for pentagons and heptagons
• Constructing certain families of 3‐polytopal graphs
• Polytopes, graphs, and complexes
• Title not available (Why is that?)
• Some analogues of Eberhard's theorem on convex polytopes
• On face vectors and vertex vectors of convex polyhedra
• On the number of hexagons in a map
• Realizations with a cut-through Eulerian circuit
• An inequality for 3-polytopes

This page was built for publication: On p-vectors of 3-polytopes

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