On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles

DOI10.1016/0012-365X(94)90133-3zbMath0798.05018OpenAlexW2042367778WikidataQ126589640 ScholiaQ126589640MaRDI QIDQ1322206

Michal Tkáč

Publication date: 17 October 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90133-3

zbMATH Keywords

3-polytopesshortness coefficient

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

A lower bound for the shortness coefficient of a class of graphs ⋮ Unnamed Item ⋮ Longest cycles in generalized Buckminsterfullerene graphs ⋮ Long cycles in fullerene graphs ⋮ Longest cycles in polyhedral graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-Hamiltonian cubic planar maps
• On the simplicial 3-polytopes with only two types of edges
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons
• Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes
• Shortness parameters of families of regular planar graphs in two or three types of faces
• Hamiltonian circuits in polytopes with even sided faces
• Non-Hamiltonian non-Grinbergian graphs
• Shortness exponents of families of graphs
• Regular planar graphs with faces of only two types and shortness parameters
• Non-Hamiltonian Simple Planar Graphs
• A class of Hamiltonian polytopes

This page was built for publication: On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles