Covering graphs with convex sets and partitioning graphs into convex sets

07/02/2019
by   Lucía M. González, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset