On p-vectors of 3-polytopes
From MaRDI portal
Publication:5570036
Cited in
(11)- An inequality for 3-polytopes
- On face vectors and vertex vectors of convex polyhedra
- Realizations with a cut-through Eulerian circuit
- scientific article; zbMATH DE number 558642 (Why is no real title available?)
- Upper bounds on the sum of powers of the degrees of a simple planar graph
- An Eberhard-like theorem for pentagons and heptagons
- Constructing certain families of 3‐polytopal graphs
- scientific article; zbMATH DE number 3988272 (Why is no real title available?)
- On the number of hexagons in a map
- Some analogues of Eberhard's theorem on convex polytopes
- Polytopes, graphs, and complexes
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)