Now showing items 1-1 of 1

    • Colouring perfect graphs with bounded clique number 

      Chudnovsky, Maria; Lagoutte, Aurélie; Seymour, Paul; Spirkl, Sophie (Elsevier, 2017-01)
      A graph is perfect if the chromatic number of every induced subgraph equals the size of its largest clique, and an algorithm of Grötschel, Lovász, and Schrijver [9] from 1988 finds an optimal colouring of a perfect graph ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages