Clique-coloring of $K_{3,3}$-minor free graphs

Behnaz Omoomi, Maryam Taleb

A clique-coloring of a given graph $G$ is a coloring of the vertices of $G$ such that no maximal clique of size at least two is monocolored. The clique-chromatic number of $G$ is t…