INMABB 05456
INSTITUTO DE MATEMATICA BAHIA BLANCA
Unidad Ejecutora - UE
artículos
Título:
Covering graphs with convex sets and partitioning graphs into convex sets
Autor/es:
GRIPPO, LUCIANO N.; SAFE, MARTÍN D.; GONZÁLEZ, LUCÍA M.; DOS SANTOS, VINICIUS F.
Revista:
INFORMATION PROCESSING LETTERS
Editorial:
ELSEVIER SCIENCE BV
Referencias:
Año: 2020 vol. 158
ISSN:
0020-0190
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.
