Every $3$-connected, essentially $11$-connected line graph is hamiltonian - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Every $3$-connected, essentially $11$-connected line graph is hamiltonian

Abstract

Thomassen conjectured that every $4$-connected line graph is hamiltonian. A vertex cut $X$ of $G$ is essential if $G-X$ has at least two nontrivial components. We prove that every $3$-connected, essentially $11$-connected line graph is hamiltonian. Using Ryjáček's line graph closure, it follows that every $3$-connected, essentially $11$-connected claw-free graph is hamiltonian.
Fichier principal
Vignette du fichier
dmAE0173.pdf (100.89 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184441 , version 1 (14-08-2015)

Identifiers

Cite

Hong-Jian Lai, Yehong Shao, Ju Zhou, Hehui Wu. Every $3$-connected, essentially $11$-connected line graph is hamiltonian. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.379-382, ⟨10.46298/dmtcs.3452⟩. ⟨hal-01184441⟩

Collections

INSMI TDS-MACS
48 View
768 Download

Altmetric

Share

Gmail Facebook X LinkedIn More