  We present some complexity results concerning the problems of covering a
graph with $p$ convex sets and of partitioning a graph into $p$ convex sets.
The following convexities are considered: digital convexity, monophonic
convexity, $P_3$-convexity, and $P_3^*$-convexity.
