On shortness exponents of families of graphs

DOI10.1007/BF02761970zbMATH Open0271.05107OpenAlexW1995205572MaRDI QIDQ759158FDOQ759158

Authors: 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

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx)

Cites Work

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

Cited In (9)

• Long cycles in fullerene graphs
• Long cycles in fullerene graphs
• Title not available (Why is that?)
• Longest cycles in r-regular r-connected graphs
• Non-Hamiltonian non-Grinbergian graphs
• Longest cycles in polyhedral graphs
• Hamiltonian circuits in prisms over certain simple 3-polytopes
• Longest cycles in generalized Buckminsterfullerene graphs
• Non-Hamiltonian simple 3-polytopes having just two types of faces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759158)