Locally Hamiltonian graphs and minimal size of maximal graphs on a surface

DOI10.37236/9286zbMath1448.05049arXiv2001.04836OpenAlexW3031903743MaRDI QIDQ2185215

Carsten Thomassen, James E. Davies

Publication date: 4 June 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.04836

zbMATH Keywords

locally Hamiltonian graphminimal size of maximal graph on a surface

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Edge‐maximal graphs on orientable and some nonorientable surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
• Minimal triangulations on orientable surfaces
• A minimum-vertex triangulation
• \(3n-5\) edges do force a subdivision of \(K_5\)
• Graphs with \(3n-6\) edges not containing a subdivision of \(K_5\)
• Homomorphism theorems for graphs
• A Maximal Toroidal Graph which is not a Triangulation.
• Edge-Maximal Graphs on Surfaces
• Locally Hamiltonian and planar graphs

This page was built for publication: Locally Hamiltonian graphs and minimal size of maximal graphs on a surface