@article{DMTCS_2005_special_250_a61,
     author = {Lai, Hong-Jian and Shao, Yehong and Zhou, Ju and Wu, Hehui},
     title = {Every $3$-connected, essentially $11$-connected line graph is hamiltonian},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3452},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3452/}
}