fact: Definition compatible (T : forest) (G : graph2) (B : T -> {set G}) := exists t, (input \in B t) && (output \in B t).
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)