The following pages link to On spanning 2-trees in a graph (Q1356500):
Displaying 18 items.
- Spanning trees: A survey (Q659663) (← links)
- Tree 3-spanners on interval, permutation and regular bipartite graphs (Q671393) (← links)
- Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- The 2-hop spanning tree problem (Q1306467) (← links)
- The complexity of the locally connected spanning tree problem (Q1408813) (← 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)
- Complexity of some graph-based bounds on the probability of a union of events (Q1752603) (← links)
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
- Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices (Q1987561) (← links)
- On minimum average stretch spanning trees in polygonal 2-trees (Q2339451) (← links)
- Maximum series-parallel subgraph (Q2429333) (← links)
- On a characterization of k-trees (Q2947993) (← links)
- Plane Triangulations Without Spanning 2-Trees (Q5060442) (← links)
- (Q5461426) (← links)
- (Q5488358) (← links)
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph (Q6558687) (← links)
