  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 planar graphs, most notably for forests and graphs
of pathwidth at most $2$.
