On spanning tree congestion
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4070955 (Why is no real title available?)
- scientific article; zbMATH DE number 3603293 (Why is no real title available?)
- A homology theory for spanning tress of a graph
- Isoperimetric numbers of graphs
- Minimal congestion trees
- Multi-Terminal Network Flows
- On embedding graphs in trees
- On tree congestion of graphs
- The congestion of \(n\)-cube layout on a rectangular grid
- The cyclic cutwidth of trees
Cited in
(11)- Spanning tree congestion of planar graphs
- Spanning tree congestion of k-outerplanar graphs
- Parameterized complexity of the spanning tree congestion problem
- Minimum congestion spanning trees in planar graphs
- On spanning tree congestion of graphs
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- Critical spanning tree and linear arrangement of torus
- Complexity results for the spanning tree congestion problem
- Spanning tree congestion of rook's graphs
- Spanning tree congestion and computation of generalized Győri-Lovász partition
- A Survey on Spanning Tree Congestion
This page was built for publication: On spanning tree congestion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044004)