Now showing items 1-2 of 2

    • Detecting an Odd Hole 

      Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Association for Computing Machinery, 2020-02)
      We give a polynomial-time algorithm to test whether a graph contains an induced cycle with length more than three and odd.
    • Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes 

      Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Elsevier, 2020-01)
      We prove a conjecture of András Gyárfás, that for all k, l, every graph with clique number at most κ and sufficiently large chromatic number has an odd hole of length at least ℓ.

      UWSpace

      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