Spanning tree congestion of rook's graphs
From MaRDI portal
Publication:2906358
DOI10.7151/DMGT.1577zbMATH Open1255.05047OpenAlexW2008906655MaRDI QIDQ2906358FDOQ2906358
Authors: Kyohei Kozawa, Yota Otachi 
Publication date: 5 September 2012
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fa78e00f17e98102fd0d5aab7249b18ec3adb030
Recommendations
- On spanning tree congestion of graphs
- Spanning tree congestion of planar graphs
- Spanning tree congestion of \(k\)-outerplanar graphs
- On tree congestion of graphs
- scientific article; zbMATH DE number 5990058
- Spanning tree congestion of the hypercube
- Complexity results for the spanning tree congestion problem
- On spanning tree congestion
- Minimum congestion spanning trees in planar graphs
- Minimum congestion spanning trees in bipartite and random graphs
Cited In (14)
- Spanning tree congestion of planar graphs
- Spanning tree congestion of \(k\)-outerplanar graphs
- Hardness results and an exact exponential algorithm for the spanning tree congestion problem
- On tree congestion of graphs
- On spanning tree congestion of graphs
- On spanning tree congestion
- Spanning tree congestion of the hypercube
- Critical spanning tree and linear arrangement of torus
- Minimal congestion trees
- Better hardness results for the minimum spanning tree congestion problem
- Spanning tree congestion and computation of generalized Győri-Lovász partition
- A Survey on Spanning Tree Congestion
- Better hardness results for the minimum spanning tree congestion problem
- Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces.
This page was built for publication: Spanning tree congestion of rook's graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906358)
