proposition: Lemma diso_perfect (A : {set F}) : perfect A = perfect (i @: A).
proof: Proof. by rewrite (perfect_imset i'). Qed.
imports: mathcomp(all_ssreflect) GraphTheory(preliminaries bij digraph sgraph) GraphTheory(dom partition coloring)