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

Authors:
B. S. Panda;D. Pradhan
Affiliations:
Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110 016, India;Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110 016, India
Venue:
Information Processing Letters
Year:
2010

Citing 3
Cited 1

On spanning 2-trees in a graph

Discrete Applied Mathematics
Dually Chordal Graphs

SIAM Journal on Discrete Mathematics
The complexity of the locally connected spanning tree problem

Discrete Applied Mathematics

Computing a minimum outer-connected dominating set for the class of chordal graphs

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

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