On tree congestion of graphs

DOI10.1016/J.DISC.2007.04.030MaRDI QIDQ952638zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complete bipartite graphgridspanning tree congestiontree congestion

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• On spanning tree congestion of graphs
• Minimal congestion trees
• On embedding graphs in trees
• Minimum congestion spanning trees in planar graphs
• Spanning tree congestion of rook's graphs

Cites work

• scientific article; zbMATH DE number 4070955 (Why is no real title available?)
• scientific article; zbMATH DE number 1490011 (Why is no real title available?)
• Minimal congestion trees
• The congestion of \(n\)-cube layout on a rectangular grid

Cited in

(22)

• On spanning tree congestion of graphs
• On spanning tree congestion
• Spanning tree congestion of the hypercube
• On embedding graphs in trees
• Parameterized complexity of the spanning tree congestion problem
• A result on k-valent graphs and its application to a graph embedding problem
• Minimal congestion trees
• The minimum stretch spanning tree problem for typical graphs
• Separator-based graph embedding into multidimensional grids with small edge-congestion
• Optimality computation of the minimum stretch spanning tree problem
• Spanning tree congestion of rook's graphs
• Complexity results for the spanning tree congestion problem
• Spanning tree congestion of planar graphs
• Embedding of cycles and wheels into arbitrary trees
• A Survey on Spanning Tree Congestion
• 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 bipartite and random graphs
• The spanning tree congestion problem on interval graphs
• Parameterized spanning tree congestion
• Minimum congestion spanning trees in planar graphs
• Security number of grid-like graphs

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)