proposition: Lemma cliquesD K H S : K \in cliques (H :\: S) -> K \in cliques H.
proof: Proof. by rewrite !inE subsetD -andbA => /and3P[-> _ ->]. Qed.
imports: mathcomp(all_ssreflect) GraphTheory(preliminaries bij digraph) GraphTheory(sgraph dom partition)