A Simple Algorithm for Coloring m-Clique Holes

Bechir Hamdaoui

An m-clique hole is a sequence $\varphi =({\Phi }_1,{\Phi }_2,\dots ,{\Phi }_m)$ of $m$ distinct cliques such that $|{\Phi }_i|\le m$ for all $i=1,2,\dots ,m$, and whose clique graph is a hole on $m$ vertices.…