Covering graphs with convex sets and partitioning graphs into convex sets

摘要

We present some complexity results concerning the problems of covering a graph with p convex sets and of partitioning a graph into pconvex sets. The following convexities are considered: digital convexity, monophonic convexity, P-3-convexity, and P*(3)-convexity. (C) 2020 Elsevier B.V. All rights reserved.