Tomáš Kaiser, Petr Vrána
Published 2019-12-31Version 1
Yang et al. proved that every 3-connected, essentially 11-connected line graph is Hamilton-connected. This was extended by Li and Yang to 3-connected, essentially 10-connected graphs. Strengthening their result further, we prove that 3-connected, essentially 9-connected line graphs are Hamilton-connected. We use a method based on quasigraphs in combination with the discharging technique. The result extends to claw-free graphs.
Hamiltonicity and $σ$-hypergraphs
Spectral Radius and Hamiltonicity of graphs
$1/2$-conjectures on the domination game and claw-free graphs
![QR code for arXiv:2001.00042 [math.CO]](http://oss.arxitics.com/images/favicon.svg)