The following pages link to Spanning trees: A survey (Q659663):
Displaying 14 items.
- Bounds on the leaf number in graphs of girth 4 or 5 (Q5035782) (← links)
- A Survey on Spanning Tree Congestion (Q5042456) (← links)
- Spanning paths and cycles in triangle-free graphs (Q5151426) (← links)
- Spanning trees with small diameters (Q5154596) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5919575) (← links)
- General variable neighborhood search for the minimum stretch spanning tree problem (Q6063503) (← links)
- Radius, leaf number, connected domination number and minimum degree (Q6110370) (← links)
- Completely independent spanning trees in line graphs (Q6133659) (← links)
- Rooted minors and locally spanning subgraphs (Q6143382) (← links)
- Progress on sufficient conditions for a graph to have a spanning \(k\)-ended tree (Q6148895) (← links)
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs (Q6542034) (← links)
- The number of spanning trees for Sierpiński graphs and data center networks (Q6614885) (← links)
- Strongly proper connected coloring of graphs (Q6621951) (← links)
