fact: Definition edge_graph a u b := two_graph a b ∔ [inl tt, u, inr tt].
imports: Coq(Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij) GraphTheory(equiv digraph setoid_bigop structures)