Coloring clique-hypergraph of $K_5$-minor-free graphs

Erfang Shan, Yuxiao Sun, Liying Kang

A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $\mathcal{H}(G)$, of a…