Spanning tree congestion of \(k\)-outerplanar graphs

DOI10.1016/j.disc.2011.03.002zbMath1223.05017OpenAlexW2046337003WikidataQ59567625 ScholiaQ59567625MaRDI QIDQ536232

Yota Otachi, Kyohei Kozawa, Takayoshi Matsushima, Hans L. Bodlaender

Publication date: 16 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.002

zbMATH Keywords

\(k\)-outerplanar graphsspanning tree congestion

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

A Survey on Spanning Tree Congestion ⋮ Optimality computation of the minimum stretch spanning tree problem ⋮ Better hardness results for the minimum spanning tree congestion problem ⋮ Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition ⋮ Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem ⋮ The minimum stretch spanning tree problem for typical graphs

Cites Work

• On tree congestion of graphs
• Minimum congestion spanning trees in planar graphs
• On spanning tree congestion of graphs
• On spanning tree congestion
• Spanning tree congestion of the hypercube
• A partial k-arboretum of graphs with bounded treewidth
• Minimal congestion trees
• Spanning tree congestion of rook's graphs
• Complexity Results for the Spanning Tree Congestion Problem
• Minimum congestion spanning trees of grids and discrete toruses
• A variation on the min cut linear arrangement problem
• Tree Spanners
• On Colorings of Squares of Outerplanar Graphs
• Tree spanners in planar graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning tree congestion of \(k\)-outerplanar graphs