proposition: Lemma diso_perfectT : perfect F = perfect G.
proof: Proof. by rewrite -!perfectT diso_perfect imset_bijT. Qed.
imports: mathcomp(all_ssreflect) GraphTheory(preliminaries bij digraph sgraph) GraphTheory(dom partition coloring)