• Title of article

    Nordhaus–Gaddum for treewidth

  • Author/Authors

    Joret، نويسنده , , Gwenaël and Wood، نويسنده , , David R.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2012
  • Pages
    3
  • From page
    488
  • To page
    490
  • Abstract
    We prove that, for every n -vertex graph G , the treewidth of G plus the treewidth of the complement of G is at least n − 2 . This bound is tight.
  • Journal title
    European Journal of Combinatorics
  • Serial Year
    2012
  • Journal title
    European Journal of Combinatorics
  • Record number

    1548435

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