Vertex-vectors of quadrangular 3-polytopes with two types of edges
S. Jendrol, E. Jucovič, M. Trenkler (1989)
Banach Center Publications
Similarity:
Displaying similar documents to “The lonely vertex problem.”
Vertex-vectors of quadrangular 3-polytopes with two types of edges
A quantitative Steinitz' theorem.
Onn, Shmuel, Sturmfels, Bernd (1994)
Beiträge zur Algebra und Geometrie
Similarity:
Gaps in the Numbers of Vertices of Cubical Polytopes, I.
R. Blind, G. Blind (1994)
Discrete & computational geometry
Similarity:
Flag vectors of multiplicial polytopes.
Bayer, Margaret M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sweeping the cd-index and the toric -vector.
Lee, Carl W. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On non-inscribable polytopes
Branko Grünbaum, Ernest Jucovič (1974)
Czechoslovak Mathematical Journal
Similarity:
All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5
Oleg V. Borodin, Anna O. Ivanova (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Lebesgue (1940) proved that every 3-polytope P5 of girth 5 has a path of three vertices of degree 3. Madaras (2004) refined this by showing that every P5 has a 3-vertex with two 3-neighbors and the third neighbor of degree at most 4. This description of 3-stars in P5s is tight in the sense that no its parameter can be strengthened due to the dodecahedron combined with the existence of a P5 in which every 3-vertex has a 4-neighbor. We give another tight description of 3-stars in P5s:...
An extension of Kotzig’s theorem on the minimum weight of edges in -polytopes
Oleg V. Borodin (1992)
Mathematica Slovaca
Similarity:
The Cubical d-Polytopes with Fewer than 2d+1 Vertices.
R. Blind, G. Blind (1995)
Discrete & computational geometry
Similarity: