On shortness exponents of families of graphs

DOI10.1007/BF02761970zbMath0271.05107OpenAlexW1995205572MaRDI QIDQ759158

Günter Ewald

Publication date: 1973

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

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

Mathematics Subject Classification ID

Related Items (9)

Longest cycles in generalized Buckminsterfullerene graphs ⋮ Non-Hamiltonian simple 3-polytopes having just two types of faces ⋮ Longest cycles in r-regular r-connected graphs ⋮ Long cycles in fullerene graphs ⋮ Long cycles in fullerene graphs ⋮ Longest cycles in polyhedral graphs ⋮ Non-Hamiltonian non-Grinbergian graphs ⋮ Hamiltonian circuits in prisms over certain simple 3-polytopes ⋮ Unnamed Item

Cites Work

• Hamiltonian circuits in simplicial complexes
• Hamiltonian circuits in some maps on the torus
• Shortness exponents of families of graphs
• Polytopes, graphs, and complexes

This page was built for publication: On shortness exponents of families of graphs