A stability version for a theorem of Erdős on nonhamiltonian graphs
From MaRDI portal
Publication:2401804
DOI10.1016/j.disc.2016.08.030zbMath1369.05118arXiv1608.05741OpenAlexW2963969806MaRDI QIDQ2401804
Ruth Luo, Zoltan Fueredi, Alexandr V. Kostochka
Publication date: 5 September 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.05741
Related Items (9)
Extremal problems on the Hamiltonicity of claw-free graphs ⋮ A variation of a theorem by Pósa ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ Non-Hamiltonian graphs with large minimum degree ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Spectral results on Hamiltonian problem ⋮ Stability results on the circumference of a graph
Cites Work
This page was built for publication: A stability version for a theorem of Erdős on nonhamiltonian graphs
