The clique-chromatic number χ c (G) of graph G is defined as the minimum number k such
that there exists a colouring of the vertices of G in k colours that satisfies the following …

A common way to tackle the computational intractability of combinatorial problems on
graphs is to impose restrictions on the input graphs that can be exploited in the design of …

A clique is defined as a complete subgraph maximal under inclusion and having at least two
vertices. A k-clique-coloring of a graph G is an assignment of k colors to the vertices of G …

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 …

A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique
contained in the closed neighborhood of a vertex. A star (biclique) k-coloring of G is a k …

A clique coloring of a graph is a coloring of the vertices so that no maximal clique is
monochromatic (ignoring isolated vertices). The smallest number of colors in such a coloring …

The clique chromatic number of a graph is the minimum number of colors in a vertex
coloring so that no maximal (with respect to containment) clique is monochromatic. We …

A maximal clique of G is a clique not properly contained in any other clique. A k-clique-
coloring of a graph G is an assignment of k colors to the vertices of G such that no maximal …

A clique is defined as a complete subgraph maximal under inclusion and having at least two
vertices. A clique-transversal of a graph G is a subset of vertices that meets all the cliques of …

Abstract Let G=(V, E) be a graph with n vertices. A clique-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 …