Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
