Bonomo, Flavia; Durán, Guillermo; Soulignac, Francisco; … - In: Mathematical Methods of Operations Research 69 (2009) 2, pp. 251-270
A graph G is coordinated if the minimum number of colors that can be assigned to the cliques of H in such a way that no two cliques with non-empty intersection receive the same color is equal to the maximum number of cliques of H with a common vertex, for every induced subgraph H of G....
