Abstract
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. © 2011 The Author(s).
Author supplied keywords
Cite
CITATION STYLE
APA
Broersma, H. J., Ryjáček, Z., & Vrána, P. (2012). How Many Conjectures Can You Stand? A Survey. Graphs and Combinatorics, 28(1), 57–75. https://doi.org/10.1007/s00373-011-1090-6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free