The following pages link to On tree congestion of graphs (Q952638):
Displaying 19 items.
- Spanning tree congestion of planar graphs (Q394137) (← links)
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- Minimum congestion spanning trees in bipartite and random graphs (Q655852) (← links)
- Minimum congestion spanning trees in planar graphs (Q966018) (← links)
- Security number of grid-like graphs (Q967295) (← links)
- On spanning tree congestion of graphs (Q1043936) (← links)
- On spanning tree congestion (Q1044004) (← links)
- Spanning tree congestion of the hypercube (Q1045206) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- A result on k-valent graphs and its application to a graph embedding problem (Q1820789) (← links)
- Minimal congestion trees (Q1877665) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
- Spanning tree congestion of rook's graphs (Q2906358) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- A Survey on Spanning Tree Congestion (Q5042456) (← links)
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem (Q5892589) (← links)