10.46298/dmtcs.502
https://dmtcs.episciences.org/502
Centeno, C. C.
C. C.
Centeno
Dantas, S.
S.
Dantas
Dourado, M. C.
M. C.
Dourado
Rautenbach, Dieter
Dieter
Rautenbach
Szwarcfiter, Jayme Luiz
Jayme Luiz
Szwarcfiter
Convex Partitions of Graphs induced by Paths of Order Three
Graphs and Algorithms
A set C of vertices of a graph G is P(3)-convex if v is an element of C for every path uvw in G with u, w is an element of C. We prove that it is NP-complete to decide for a given graph G and a given integer p whether the vertex set of G can be partitioned into p non-empty disjoint P(3)-convex sets. Furthermore, we study such partitions for a variety of graph classes.
episciences.org
graph convexity
convex partition
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
2010-01-01
2010-01-01
en
journal article
https://hal.science/hal-00990463v1
1365-8050
https://dmtcs.episciences.org/502/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 12 no. 5
Graph and Algorithms
Researchers
Students