Browsing Waterloo Research by Subject "x-boundedness"
Now showing items 1-2 of 2
-
Polynomial bounds for chromatic number VII. Disjoint holes.
(Wiley, 2023-11)A hole in a graph G is an induced cycle of length at least four, and a k-multihole in G is the union of k pairwise disjoint and nonneighbouring holes. It is well know that if G does not contain any holes then its chromatic ... -
Polynomial bounds for chromatic number VII. Disjoint holes.
(Wiley, 2023-05-14)A hole in a graph G is an induced cycle of length at least four, and a k-multihole in G is the union of k pairwise disjoint and nonneighbouring holes. It is well known that if G does not contain any holes then its chromatic ...