Centeno, C. C. and Dantas, S. and Dourado, M. C. and Rautenbach, Dieter and Szwarcfiter, Jayme Luiz - Convex Partitions of Graphs induced by Paths of Order Three

dmtcs:502 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, Vol. 12 no. 5
Convex Partitions of Graphs induced by Paths of Order Three

Authors: Centeno, C. C. and Dantas, S. and Dourado, M. C. and Rautenbach, Dieter and Szwarcfiter, Jayme Luiz

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.


Source : oai:HAL:hal-00990463v1
Volume: Vol. 12 no. 5
Section: Graph and Algorithms
Published on: January 1, 2010
Submitted on: March 26, 2015
Keywords: graph convexity,convex partition,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 39 times.
This article's PDF has been downloaded 66 times.