Spanning tree congestion of planar graphs
From MaRDI portal
Publication:394137
DOI10.2140/INVOLVE.2014.7.205zbMATH Open1280.05020OpenAlexW2091006356MaRDI QIDQ394137FDOQ394137
Authors: Siu Lam Leung, Mikhail Ostrovskii, Hiu Fai Law 
Publication date: 24 January 2014
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/involve.2014.7.205
Recommendations
- On spanning tree congestion of graphs
- Minimum congestion spanning trees in planar graphs
- Spanning tree congestion of \(k\)-outerplanar graphs
- Spanning tree congestion of rook's graphs
- scientific article; zbMATH DE number 975390
- On tree congestion of graphs
- Tree spanners in planar graphs
- scientific article; zbMATH DE number 5990058
- Spanning tree congestion of the hypercube
- On spanning tree congestion
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (11)
- Parameterized complexity of the spanning tree congestion problem
- Spanning tree congestion of \(k\)-outerplanar graphs
- Minimum congestion spanning trees in planar graphs
- On spanning tree congestion
- Tree spanners in planar graphs
- Complexity results for the spanning tree congestion problem
- Minimal congestion trees
- Minimum spanning tree cycle intersection problem on outerplanar graphs
- 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: Spanning tree congestion of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394137)
