Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4651242 | Discrete Mathematics | 2007 | 8 Pages |
Abstract
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of vv in T induces a connected subgraph of G for every v∈V(G)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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen,