proposition: Lemma perfectT (F : sgraph) : perfect([set: F]) = perfect(F).
proof: Proof. by apply: eq_forallb => A; rewrite subsetT subset_predT. Qed.
imports: mathcomp(all_ssreflect) GraphTheory(preliminaries bij digraph sgraph) GraphTheory(dom partition coloring)