Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs

被引：2
|
作者：
Panda, B. S. [1 ]
Pradhan, D. [1 ]
机构：
[1] Indian Inst Technol Delhi, Comp Sci & Applicat Grp, Dept Math, New Delhi 110016, India
来源：
INFORMATION PROCESSING LETTERS | 2010年 / 110卷 / 23期
关键词：
Algorithms; Graph algorithms; Locally connected spanning tree; NP-complete; NETWORKS; 2-TREES;
D O I：
10.1016/j.ipl.2010.09.008
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A spanning tree T of a graph G = (V, E) is called a locally connected spanning tree if the set of all neighbors of v in T induces a connected subgraph of G for all v is an element of V. The problem of recognizing whether a graph admits a locally connected spanning tree is known to be NP-complete even when the input graphs are restricted to chordal graphs. In this paper, we propose linear time algorithms for finding locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs, respectively. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：1067 / 1073
页数：7
相关论文
共 50 条
  • [21] Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
    Bonamy, Marthe
    Johnson, Matthew
    Lignos, Ioannis
    Patel, Viresh
    Paulusma, Daniel
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 132 - 143
  • [22] Classes of bipartite graphs related to chordal graphs
    1600, (32):
  • [23] CLASSES OF BIPARTITE GRAPHS RELATED TO CHORDAL GRAPHS
    BRANDSTADT, A
    DISCRETE APPLIED MATHEMATICS, 1991, 32 (01) : 51 - 60
  • [24] Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
    Anil, Arun
    Changat, Manoj
    Discrete Mathematics and Theoretical Computer Science, 2024, 26 (03):
  • [25] STEINER TREES, CONNECTED DOMINATION AND STRONGLY CHORDAL GRAPHS
    WHITE, K
    FARBER, M
    PULLEYBLANK, W
    NETWORKS, 1985, 15 (01) : 109 - 124
  • [26] Spanning k-ended trees of bipartite graphs
    Kano, Mikio
    Matsuda, Haruhide
    Tsugaki, Masao
    Yan, Guiying
    DISCRETE MATHEMATICS, 2013, 313 (24) : 2903 - 2907
  • [27] The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs
    Lotfi, Dounia
    El Marraki, Mohamed
    Aboutajdine, Driss
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2015, 18 (06): : 673 - 687
  • [28] MINIMUM CONGESTION SPANNING TREES IN BIPARTITE AND RANDOM GRAPHS
    M.I. Ostrovskii
    Acta Mathematica Scientia, 2011, 31 (02) : 634 - 640
  • [29] Clique trees of infinite locally finite chordal graphs
    Hofer-Temmel, Christoph
    Lehner, Florian
    ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (02):
  • [30] MINIMUM CONGESTION SPANNING TREES IN BIPARTITE AND RANDOM GRAPHS
    Ostrovskii, M. I.
    ACTA MATHEMATICA SCIENTIA, 2011, 31 (02) : 634 - 640
12345