A structural property of convex 3-polytopes
From MaRDI portal
Publication:1376488
DOI10.1023/A:1004993723280zbMATH Open0893.52007MaRDI QIDQ1376488FDOQ1376488
Authors: Stanislav Jendroľ 
Publication date: 27 January 1998
Published in: Geometriae Dedicata (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3913153
- A convexity problem in 3-polytopal graphs
- An inequality for 3-polytopes
- scientific article; zbMATH DE number 4065938
- Geometrical properties of polyconvex polytopes
- scientific article; zbMATH DE number 2007690
- Some properties of three-dimensional Klein polyhedra
- A property of graphs of convex polytopes
Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Paths and cycles (05C38)
Cited In (36)
- 3-paths in graphs with bounded average degree
- All tight descriptions of 3-paths in plane graphs with girth at least 9
- Describing 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
- Describing short paths in plane graphs of girth at least 5
- Light paths in 4-connected graphs in the plane and other surfaces
- All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
- Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8
- Light 3-stars in sparse plane graphs
- Title not available (Why is that?)
- Lightness, heaviness and gravity
- An analogue of Franklin's theorem
- Light subgraphs in graphs with average degree at most four
- Tight Descriptions of 3‐Paths in Normal Plane Maps
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
- All tight descriptions of 3-paths in plane graphs with girth 8
- Weight of 3-paths in sparse plane graphs
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
- On \(3\)-connected plane graphs without triangular faces
- All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
- 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
- Light 3-faces in 3-polytopes without adjacent triangles
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
- Note on 3-paths in plane graphs of girth 4
- Subgraphs with restricted degrees of their vertices in planar graphs
- Light 3-paths in 3-polytopes without adjacent triangles
- Title not available (Why is that?)
- On the faces of unigraphic 3-polytopes
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
- Describing 4-paths in 3-polytopes with minimum degree 5
- Light minor 5-stars in 3-polytopes with minimum degree 5
- Low 5-stars in normal plane maps with minimum degree 5
- Title not available (Why is that?)
This page was built for publication: A structural property of convex 3-polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376488)
