Strict Strong Graph Coloring
Meriem Bensouyad, Nousseiba Guidoum, Djamel Eddine Saïdouni · 2015
This paper addresses a recent combinatorial optimization problem called the Strict Strong graph coloring. This new coloring parameter investigates the use of dominance relation between graph vertices and color classes. This kind of coloring has been defined by Haddad and Kheddouci. It consists in properly coloring the graph in a way each vertex dominates at least one color class.