%0 Journal Article
%A Lai, Hong-Jian
%A Shao, Yehong
%A Zhou, Ju
%A Wu, Hehui
%T Every $3$-connected, essentially $11$-connected line graph is hamiltonian
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3452/
%R 10.46298/dmtcs.3452
%G en
%F DMTCS_2005_special_250_a61