Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q400523 |
Changed an Item |
||
| Property / author | |||
| Property / author: Gerard Jennhwa Chang / rank | |||
Normal rank | |||
Revision as of 09:28, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs |
scientific article |
Statements
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (English)
0 references
13 February 2007
0 references
A spanning tree \(T\) of a graph \(G=(V,E)\) is locally connected if for all \(v \in V\) the subgraph of \(G\) induced by \(N_T(v)\) is connected. \textit{L. Cai} [Discrete Appl. Math. 131, 63--75 (2003; Zbl 1022.05079)] showed that it is NP-complete to decide whether a graph has a locally connected spanning tree. Restricted to strongly chordal graphs and circular-arc graphs this problem becomes solvable in linear time, if a simple elimination ordering or arc-intersection model is provided with the input.
0 references
algorithm
0 references
circular-arc graph
0 references
directed path graph
0 references
interval graph
0 references
locally connected spanning tree
0 references
proper circular-arc graph
0 references
strongly chordal graph
0 references
