Longest cycles in polyhedral graphs

DOI10.1007/BF02764642zbMath0784.05059OpenAlexW1975980926MaRDI QIDQ690053

Hansjoachim Walther

Publication date: 17 March 1994

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02764642

zbMATH Keywords

polyhedral graphsshortness exponent

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Paths and cycles (05C38) Graph theory (05C99)

Related Items (1)

Unnamed Item

Cites Work

• On shortness exponents of families of graphs
• On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
• Shortness exponents of families of graphs
• Longest Simple Paths in Polyhedral Graphs
• Regular planar graphs with faces of only two types and shortness parameters

This page was built for publication: Longest cycles in polyhedral graphs