fact: Definition admissible (eqv : rel (union G1 G2)) := forall x y, eqv x y -> x = y \/ [set x;y] \subset P.
imports: Coq(RelationClasses Setoid) mathcomp(all_ssreflect) GraphTheory(edone set_tac finite_quotient preliminaries) GraphTheory(digraph sgraph treewidth minor equiv setoid_bigop) GraphTheory(structures mgraph pttdom ptt mgraph2 skeleton)