Locating any two vertices on Hamiltonian cycles in large graphs

DOI10.1016/J.DISC.2020.111941zbMath1443.05110arXiv1708.00231OpenAlexW2741998008MaRDI QIDQ776260

Hao Li, Qiang Sun, Wei-Hua He

Publication date: 8 July 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

regularity lemmaHamiltonian cycleEnomoto's conjectureblow-up lemma

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Hamiltonian cycles with all small even chords
• Locating pairs of vertices on Hamiltonian cycles
• Edge-disjoint Hamilton cycles in graphs
• Note on locating pairs of vertices on Hamiltonian cycles
• Distributing vertices along a Hamiltonian cycle in Dirac graphs
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• Distributing pairs of vertices on Hamiltonian cycles
• On a Hamiltonian cycle in which specified vertices are uniformly distributed
• Recent advances on the Hamiltonian problem: survey III
• Hamilton Cycles, Minimum Degree, and Bipartite Holes
• Some Theorems on Abstract Graphs

This page was built for publication: Locating any two vertices on Hamiltonian cycles in large graphs