info:eu-repo/semantics/article
Covering graphs with convex sets and partitioning graphs into convex sets
Fecha
2020-06Registro en:
González, Lucía M.; Grippo, Luciano Norberto; Safe, Martin Dario; Fernandes Dos Santos, Vinicius; Covering graphs with convex sets and partitioning graphs into convex sets; Elsevier Science; Information Processing Letters; 158; 105944; 6-2020; 1-5
0020-0190
CONICET Digital
CONICET
Autor
González, Lucía M.
Grippo, Luciano Norberto
Safe, Martin Dario
Fernandes Dos Santos, Vinicius
Resumen
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, P3-convexity, and P3 ⁎-convexity.