Disjoint Hamilton cycles in the random geometric graph

DOI10.1002/jgt.20560zbMath1234.05208arXiv0907.4459OpenAlexW2022630997WikidataQ57991442 ScholiaQ57991442MaRDI QIDQ3106267

Xavier Pérez-Giménez, Tobias Müller, Nicholas C. Wormald

Publication date: 20 December 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

threshold functionHamilton cyclerandom geometric graph process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Hamiltonicity of graphs perturbed by a random geometric graph ⋮ Bridged Hamiltonian cycles in sub-critical random geometric graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ Perfect matchings and Hamiltonian cycles in the preferential attachment model ⋮ On the treewidth of random geometric graphs and percolated grids ⋮ The acquaintance time of (percolated) random geometric graphs

Cites Work

• Unnamed Item
• Random Geometric Graphs
• Sharp Threshold for Hamiltonicity of Random Geometric Graphs

This page was built for publication: Disjoint Hamilton cycles in the random geometric graph