On tree congestion of graphs
From MaRDI portal
Publication:952638
DOI10.1016/J.DISC.2007.04.030zbMATH Open1151.05014OpenAlexW2111400740MaRDI QIDQ952638FDOQ952638
Authors: Stephen W. Hruska 
Publication date: 12 November 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.030
Recommendations
Cites Work
Cited In (20)
- Spanning tree congestion of planar graphs
- Parameterized complexity of the spanning tree congestion problem
- Spanning tree congestion of \(k\)-outerplanar graphs
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- Minimum congestion spanning trees in planar graphs
- On spanning tree congestion of graphs
- On spanning tree congestion
- Spanning tree congestion of the hypercube
- Separator-based graph embedding into multidimensional grids with small edge-congestion
- The minimum stretch spanning tree problem for typical graphs
- Complexity results for the spanning tree congestion problem
- Minimal congestion trees
- Embedding of cycles and wheels into arbitrary trees
- Optimality computation of the minimum stretch spanning tree problem
- Minimum congestion spanning trees in bipartite and random graphs
- Spanning tree congestion of rook's graphs
- A Survey on Spanning Tree Congestion
- On embedding graphs in trees
- Security number of grid-like graphs
- A result on k-valent graphs and its application to a graph embedding problem
This page was built for publication: On tree congestion of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952638)
