fact: Definition kconnected_map (k : nat) (G : hypermap) := k < fcard node G /\ forall A : pred G, #|A| < k -> {in [predC fclosure node A]&, forall x y, connect (restrict [predC fclosure node A] glink) x y}.
imports: mathcomp(all_ssreflect) GraphTheory(edone preliminaries digraph sgraph) fourcolor(hypermap geometry jordan color coloring combinatorial4ct) GraphTheory(hmap_ops)