Pages that link to "Item:Q1408813"
From MaRDI portal
The following pages link to The complexity of the locally connected spanning tree problem (Q1408813):
Displaying 6 items.
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs (Q1675823) (← links)
- A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (Q1731506) (← links)
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
