Browsing by Subject "Polynomial time algorithm"
Now showing items 1-1 of 1
-
(Elsevier, 2017)We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are 2-clique colorable. In ...