Now showing items 1-3 of 3

    • Approximately Coloring Graphs Without Long Induced Paths 

      Chudnovsky, Maria; Schaudt, Oliver; Spirkl, Sophie; stein, maya; Zhong, Mingxian (Springer Nature, 2019)
      It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on t vertices, for fixed t. We propose an algorithm that, given a 3-colorable ...
    • Complexity of Ck-coloring in hereditary classes of graphs 

      Chudnovsky, Maria; Huang, Shenwei; Rzazewski, Pawel; Spirkl, Sophie; Zhong, Mingxian (Elsevier, 2023-06)
      For a graph F, a graph G is F-free if it does not contain an induced subgraph isomorphic to F. For two graphs G and H, an H-coloring of G is a mapping f : V (G) → V (H) such that for every edge uv ∈ E(G) it holds that ...
    • List 3-Coloring Graphs with No Induced P6+rP3 

      Chudnovsky, Maria; Huang, Shenwei; Spirkl, Sophie; Zhong, Mingxian (Springer Nature, 2021-01-01)
      For an integer t, we let Pt denote the t-vertex path. We write H+G for the disjoint union of two graphs H and G, and for an integer r and a graph H, we write rH for the disjoint union of r copies of H. We say that a graph ...

      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