How Many Conjectures Can You Stand? A Survey

H. J. Broersma, Z. Ryjáček, P. Vrána
2011 Graphs and Combinatorics  
We survey results and open problems in hamiltonian graph theory centered around two conjectures of the 1980s that are still open: every 4-connected claw-free graph (line graph) is hamiltonian. These conjectures have lead to a wealth of interesting concepts, techniques, results and equivalent conjectures.
doi:10.1007/s00373-011-1090-6 fatcat:jj7oxvyx5vhrzdjtv2qyj7nysy