A structural property of convex 3-polytopes

DOI10.1023/A:1004993723280MaRDI QIDQ1376488zbMATH OpenFDO

Authors Stanislav Jendroľ

Publication date 27 January 1998

Published in Geometriae Dedicata (Search for Journal in Brave)

zbMATH Keywords

3-polytopedegreeedge path

Mathematics Subject Classification ID

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)

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

Cited in

(37)

• 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
• Describing 3-paths in normal plane maps
• All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
• 3-paths in graphs with bounded average degree
• All tight descriptions of 3-paths in plane graphs with girth at least 7
• Weight of 3-paths in sparse plane graphs
• On the faces of unigraphic 3-polytopes
• Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
• Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
• Low 5-stars in normal plane maps with minimum degree 5
• On the simplicity of the coded path of the code \((i)\)
• Light 3-paths in 3-polytopes without adjacent triangles
• Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
• Describing tight descriptions of 3-paths in triangle-free normal plane maps
• scientific article; zbMATH DE number 2007690 (Why is no real title available?)
• scientific article; zbMATH DE number 5697797 (Why is no real title available?)
• All tight descriptions of 3-paths in plane graphs with girth 8
• All tight descriptions of 3-paths in plane graphs with girth at least 9
• Tight descriptions of 3-paths in normal plane maps
• On \(3\)-connected plane graphs without triangular faces
• All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
• Describing short paths in plane graphs of girth at least 5
• Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
• Light 3-stars in sparse plane graphs
• Lightness, heaviness and gravity
• Light paths in 4-connected graphs in the plane and other surfaces
• Note on 3-paths in plane graphs of girth 4
• Light minor 5-stars in 3-polytopes with minimum degree 5
• Subgraphs with restricted degrees of their vertices in planar graphs
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• Describing 4-paths in 3-polytopes with minimum degree 5
• Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
• An analogue of Franklin's theorem
• Light subgraphs in graphs with average degree at most four
• Light 3-faces in 3-polytopes without adjacent triangles
• scientific article; zbMATH DE number 739024 (Why is no real title available?)

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)