Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters

DOI10.1016/0012-365X(93)E0141-PzbMath0823.05035WikidataQ126982431 ScholiaQ126982431MaRDI QIDQ1343788

Peter J. Owens, Stanlislav Jendroľ

Publication date: 8 October 1995

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

zbMATH Keywords

shortness exponentshortness coefficientmaximum cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Unnamed Item ⋮ 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one

Cites Work

• Convex 3-polytopes with exactly two types of edges
• Simple 3-polytopal graphs with edges of only two types and shortness coefficients
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• On a class of Hamiltonian polytopes
• Non-Hamiltonian simple 3-polytopes having just two types of faces
• Shortness exponents of families of graphs
• Regular planar graphs with faces of only two types and shortness parameters
• Shortness parameters for planar graphs with faces of only one type
• Some new results about the shortness exponent in polyhedral graphs
• Matchings in polytopal graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters