Hamiltonian completions of sparse random graphs
From MaRDI portal
Publication:2576345
DOI10.1016/j.dam.2005.05.001zbMath1080.05086MaRDI QIDQ2576345
M. I. Sviridenko, David Gamarnik
Publication date: 27 December 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.001
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The total interval number of a tree and the Hamiltonian completion number of its line graph
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Hamiltonian circuits in random graphs
- A linear algorithm for the Hamiltonian completion number of the line graph of a tree
- Advances on the Hamiltonian Completion Problem
- On the optional hamiltonian completion problem