Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to
union-closed antimatroids or learning spaces. We define an operation of resolution for …

All graphs in this paper are finite and simple. In a graph G, a subset M of V (G) is a module
[22](or a clan [14], or an interval [13, 21]) of G provided that for all a, b∈ M and x∈ V (G)\M …