Learn More
We investigate a theorem relating detours, tree congestion, and spanning tree congestion of a graph. Specifically, we calculate exact formulas for t(G), s(G), and the upper bound |EG| − |VG| + 2 for various families of graphs, including grids and complete bipartite graphs. The question of cutwidth has been addressed much in the literature because of its(More)
  • 1