Lin, C.-C.C.-C.LinGERARD JENNHWA CHANGChen, Gen-HueyGen-HueyChen2018-09-102018-09-102007http://www.scopus.com/inward/record.url?eid=2-s2.0-33845199907&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/329032A 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 ∈ 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. © 2006 Elsevier B.V. All rights reserved.application/pdf177913 bytesapplication/pdfAlgorithm; Circular-arc graph; Directed path graph; Interval graph; Locally connected spanning tree; Proper circular-arc graph; Strongly chordal graphAlgorithms; Set theory; Circular arc graph; Directed path graph; Interval graph; Locally connected spanning tree; Proper circular arc graph; Strongly chordal graph; Trees (mathematics)journal article10.1016/j.disc.2006.06.0262-s2.0-33845199907