Browsing University of Waterloo by Subject "hereditary graph classes"
Now showing items 1-1 of 1
-
Complexity of Ck-coloring in hereditary classes of graphs
(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 ...