@article{dmtcs:2082,
    title      = {Spanning connectedness and Hamiltonian thickness of graphs and interval graphs},
    author     = {Peng Li and Yaokun Wu},
    url        = {https://dmtcs.episciences.org/2082},
    doi        = {10.46298/dmtcs.2082},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {Vol. 16 no. 2},
    issuetitle = {PRIMA 2013},
    eid        = 1,
    year       = {2015},
    month      = {Nov},
    keywords   = {Chvátal-Erdős Theorem, fault tolerance, forward degree sequence, graph power, interval representation, local spanning cut function, normal path algorithm, path cover number, rooted path system, scattering number, spanning rail connectivity, spanning fan connectivity, [INFO]Computer Science [cs], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]},
    language   = {English},
}