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

- Bhawani Sankar Panda, Dinabandhu Pradhan
- Inf. Process. Lett.
- 2010

Highly Influenced

@article{Cai1997OnS2, title={On Spanning 2-trees in a Graph}, author={Leizhen Cai}, journal={Discrete Applied Mathematics}, year={1997}, volume={74}, pages={203-216} }

- Published 1997 in Discrete Applied Mathematics
DOI:10.1016/S0166-218X(96)00045-5

A k-tree is either a complete graph on k vertices or a graph T that contains a vertex whose neighbourhood in T induces a complete graph on k vertices and whose removal results in a k-tree. A subgraph of a graph is a spanning k-tree if it is a k-tree and contains every vertex of the graph. This paper is concerned with spanning 2-trees in a graph. It is shown that spanning 2-trees have close connections with two special types of spanning trees: locally-connected spanning trees (A locallyâ€¦Â CONTINUE READING

### Presentations referencing similar topics