Volume 97, Issue 2 p. 241-259
ARTICLE

The Hamiltonicity of essentially 9-connected line graphs

Tomáš Kaiser,

Corresponding Author

Tomáš Kaiser

Department of Mathematics and European Centre of Excellence NTIS (New Technologies for the Information Society), University of West Bohemia, Plzeň, Czech Republic

Correspondence Tomáš Kaiser, Department of Mathematics and European Centre of Excellence NTIS (New Technologies for the Information Society), University of West Bohemia, Univerzitní 8, 306 14 Plzeň, Czech Republic.

Email: kaisert@kma.zcu.cz

Search for more papers by this author
Petr Vrána,

Petr Vrána

Department of Mathematics and European Centre of Excellence NTIS (New Technologies for the Information Society), University of West Bohemia, Plzeň, Czech Republic

Search for more papers by this author
First published: 07 December 2020

Abstract

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 line 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.

DATA AVAILABILITY STATEMENT

Data sharing is not applicable to this article as no data sets were generated or analysed during the current study.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.