The paper presents a polynomial-time algorithm to decide whether two disjoint, convex sets in a graph can be separated by complementary convex half-spaces in the monophonic convexity.
