Covering graphs with convex sets and partitioning graphs into convex sets

GONZÁLEZ, LUCÍA M.; GRIPPO, LUCIANO N.; SAFE, MARTÍN D.; DOS SANTOS, VINICIUS F.

INFORMATION PROCESSING LETTERS

ELSEVIER SCIENCE BV

Año: 2020 vol. 158

0020-0190

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.