1 paper
Csaba Biró, Gabriel Collado, Oscar Zamora
The indeque number of a graph is largest set of vertices that induce an independent set of cliques. We study the extremal value of this parameter for the class and subclasses of pl…