On the simplicial 3-polytopes with only two types of edges
From MaRDI portal
Publication:791872
DOI10.1016/0012-365X(84)90185-7zbMath0536.52003MaRDI QIDQ791872
Michal Tkáč, Stanlislav Jendroľ
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (13)
A lower bound for the shortness coefficient of a class of graphs ⋮ On a class of Hamiltonian polytopes ⋮ Convex 3-polytopes with exactly two types of edges ⋮ Edge-oblique polyhedral graphs. ⋮ Shortness coefficients of simple 3-polytopal graphs with edges of only two types ⋮ On quadrangular convex 3-polytopes with at most two types of edges ⋮ Unnamed Item ⋮ Edge-Oblique Polyhedral Graphs ⋮ Unnamed Item ⋮ Maximum vertex and face degree of oblique graphs ⋮ On cubic polyhedral graphs with prescribed adjacency properties of their faces ⋮ Simple 3-polytopal graphs with edges of only two types and shortness coefficients ⋮ On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Non-Hamiltonian simple 3-polytopes having just two types of faces
- Shortness parameters of families of regular planar graphs in two or three types of faces
- Strengthening of a theorem about 3-polytopes
- The existence of certain planar maps
- Matchings in polytopal graphs
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
This page was built for publication: On the simplicial 3-polytopes with only two types of edges
