On clique-colouring of graphs with few P 4s
Let G=(V,E) be a graph with n vertices. Aclique-colouring of a graph is a colouring of its vertices such that no maximal clique of size at least two is monocoloured. A k-clique-colouring is a clique-colouring that uses k colours. The clique-chromatic number of a graph G is the minimum k such that G has a k-clique-colouring.
clique-colouring graphs primeval decomposition p 4-structure