Hamilton cycles in 5-connected line graphs
European Journal of Combinatorics
Collapsible graphs and Hamiltonian connectedness of line graphs
Discrete Applied Mathematics
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
Journal of Graph Theory
Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs
Journal of Graph Theory
Hi-index | 0.00 |
We introduce a closure concept that turns a claw-free graph into the line graph of a multigraph while preserving its (non-)Hamilton-connectedness. As an application, we show that every 7-connected claw-free graph is Hamilton-connected, and we show that the well-known conjecture by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian) is equivalent with the statement that every 4-connected claw-free graph is Hamilton-connected. Finally, we show a natural way to avoid the non-uniqueness of a preimage of a line graph of a multigraph, and we prove that the closure operation is, in a sense, best possible. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:152-173, 2011 © 2011 Wiley Periodicals, Inc.