How Many Conjectures Can You Stand? A Survey
Hajo J. Broersma, Zdeněk Ryjáček, Petr Vrána · Graphs and Combinatorics · 2011
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.