A structural property of convex 3-polytopes
From MaRDI portal
Publication:1376488
DOI10.1023/A:1004993723280zbMath0893.52007MaRDI QIDQ1376488
Publication date: 27 January 1998
Published in: Geometriae Dedicata (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (31)
All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ 3-paths in graphs with bounded average degree ⋮ An analogue of Franklin's theorem ⋮ Light subgraphs in graphs with average degree at most four ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ Light 3-stars in sparse plane graphs ⋮ Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 ⋮ Lightness, heaviness and gravity ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 7 ⋮ Subgraphs with restricted degrees of their vertices in planar 3-connected graphs ⋮ All tight descriptions of 3-paths in plane graphs with girth 8 ⋮ Describing 3-paths in normal plane maps ⋮ Weight of 3-paths in sparse plane graphs ⋮ Optimal unavoidable sets of types of 3-paths for planar graphs of given girth ⋮ Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices ⋮ Light 3-paths in 3-polytopes without adjacent triangles ⋮ Describing short paths in plane graphs of girth at least 5 ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ Light paths in 4-connected graphs in the plane and other surfaces ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) ⋮ Light minor 5-stars in 3-polytopes with minimum degree 5 ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8 ⋮ Subgraphs with restricted degrees of their vertices in planar graphs ⋮ All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 ⋮ Note on 3-paths in plane graphs of girth 4 ⋮ Describing tight descriptions of 3-paths in triangle-free normal plane maps ⋮ Tight Descriptions of 3‐Paths in Normal Plane Maps ⋮ Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
This page was built for publication: A structural property of convex 3-polytopes
