Title of article
On tree congestion of graphs Original Research Article
Author/Authors
Stephen W. Hruska، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
9
From page
1801
To page
1809
Abstract
This paper investigates the problem of embedding a graph into a tree with the same vertex set (a spanning tree in particular), such that the maximum congestion of the edges is minimized. We calculate exact formulas for the tree congestion and spanning tree congestion for various families of graphs, including grids and complete bipartite graphs.
Keywords
Graph , Spanning tree congestion , Tree congestion , Complete bipartite , Grid
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947263
Link To Document