On the extremal number of edges in Hamiltonian connected graphs

DOI10.1016/j.aml.2009.03.025zbMath1203.05078OpenAlexW2046642168MaRDI QIDQ1049242

Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Tung-Yang Ho, D. Frank Hsu

Publication date: 8 January 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.03.025

zbMATH Keywords

Hamiltonian connectededge-fault tolerant Hamiltonian connected

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

An improvement of spectral conditions for Hamilton-connected graphs ⋮ Generalizations of the classics to spanning connectedness ⋮ The number of edges, spectral radius and Hamilton-connectedness of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Fault-tolerant Hamiltonicity of twisted cubes
• Hyper Hamiltonian laceability on edge fault star graph
• Hamilton connected graphs
• Conditional fault Hamiltonicity of the complete graph
• Conditional fault hamiltonian connectivity of the complete graph
• Note on Hamilton Circuits
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• On a Problem of Ore
• A sufficient condition for hamiltonian connectedness

This page was built for publication: On the extremal number of edges in Hamiltonian connected graphs