@article{dmtcs:3452,
    title      = {Every $3$-connected, essentially $11$-connected line graph is hamiltonian},
    author     = {Hong-Jian Lai and Yehong Shao and Ju Zhou and Hehui Wu},
    url        = {https://dmtcs.episciences.org/3452},
    doi        = {10.46298/dmtcs.3452},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
    issuetitle = {Proceedings},
    eid        = 62,
    year       = {2005},
    month      = {Jan},
    keywords   = {Line graph, claw-free graph, supereulerian graphs, collapsible graph, hamiltonian graph, dominating Eulerian subgraph, essential connectivity, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]},
    language   = {English},
}