Locally connected spanning trees on graphs
<|reference_start|>Locally connected spanning trees on graphs: A locally connected spanning tree of a graph $G$ is a spanning tree $T$ of $G$ such that the set of all neighbors of $v$ in $T$ induces a connected subgraph of $G$ for every $v\in V(G)$. The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.<|reference_end|>
@article{lin2004locally,
    title={Locally connected spanning trees on graphs},
    author={Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen},
    journal={arXiv preprint arXiv:cs/0409013},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0409013},
    primaryClass={cs.DS cs.DM}
}