Spanning tree congestion of planar graphs
Hiu Fai Law, Siu Lam Leung, Mikhail I. Ostrovskii · Involve a Journal of Mathematics · 2013
This paper is devoted to estimates of the spanning tree congestion for some planar graphs.We present three main results: (1) We almost determined (up to ±1) the maximal possible spanning tree congestion for planar graphs.(2) The value of congestion indicator introduced by Ostrovskii [Discrete Math. 310, 1204-1209] can be very far from the value of the spanning tree congestion.(3) We find some more examples in which the congestion indicator can be used to find the exact value of the spanning tree congestion.