Convex graph covers
We study some properties of minimum convex covers and minimum convex partitions of simple graphs. We establish existence of graphs with fixed number of minimum convex covers and minimum convex partitions. It is known that convex $p$-cover problem is NP-complete for $p\geq3$ [5]. We prove that this p...
Main Authors: | Radu Buzatu, Sergiu Cataranciuc |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2015-11-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v23-n3/v23-n3-(pp251-269).pdf |
Similar Items
-
On Nontrivial Covers and Partitions of Graphs by Convex Sets
by: Radu Buzatu, et al.
Published: (2018-05-01) -
On the Computational Complexity of Optimization Convex Covering Problems of Graphs
by: Radu Buzatu
Published: (2020-09-01) -
Convexity and graph theory /
by: 308271 Rosenfeld, M., et al.
Published: (1984) -
An algorithmic approach to convex fair partitions of convex polygons
by: Mathilda Campillo, et al.
Published: (2024-06-01) -
Convex Partitions of Graphs induced by Paths of Order Three
by: C. C. Centeno, et al.
Published: (2010-01-01)