Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs

被引：4
|
作者：
Lin, Ching-Chi
Chang, Gerard J. [1 ]
Chen, Gen-Huey
机构：
[1] Natl Taiwan Univ, Dept Math, Taipei 10617, Taiwan
[2] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10617, Taiwan
来源：
DISCRETE MATHEMATICS | 2007年 / 307卷 / 02期
关键词：
algorithm; circular-arc graph; directed path graph; interval graph; locally connected spanning tree; proper circular-arc graph; strongly chordal graph;
D O I：
10.1016/j.disc.2006.06.026
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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 is an element of 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. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：208 / 215
页数：8
相关论文
共 50 条
12345