• Title of article

    On spanning tree congestion

  • Author/Authors

    Michael A. and Lِwenstein، نويسنده , , Christian and Rautenbach، نويسنده , , Dieter and Regen، نويسنده , , Friedrich، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2009
  • Pages
    3
  • From page
    4653
  • To page
    4655
  • Abstract
    We prove that every connected graph G of order n has a spanning tree T such that for every edge e of T the edge cut defined in G by the vertex sets of the two components of T − e contains at most n 3 2 edges. This result solves a problem posed by Ostrovskii (M.I. Ostrovskii, Minimal congestion trees, Discrete Math. 285 (2004) 219–226).
  • Keywords
    Gomory–Hu tree , LAYOUT , embedding , Congestion , Edge cut , Cutwidth
  • Journal title
    Discrete Mathematics
  • Serial Year
    2009
  • Journal title
    Discrete Mathematics
  • Record number

    1598980

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1598980