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 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.

• Type: Journal
• Year: 2004
• Where: CORR
• Authors: Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
• Keywords: Connected Subgraph, CORR 2004, Education, Locally Connected, Spanning Trees