Browsing Waterloo Research by Subject "coloring algorithm"
Now showing items 1-1 of 1
-
The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
(Elsevier, 2023-04)Motivated by the analogous questions in graphs, we study the complexity of coloring and stable set problems in hypergraphs with forbidden substructures and bounded edge size. Letting v(g) denote the maximum size of a ...