2. Articole

Browse

Now showing 1 - 3 of 3

ON NONTRIVIAL COVERS AND PARTITIONS OF GRAPHS BY CONVEX SETS
(Institutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldovei, 2018) Buzatu, Radu; Cataranciuc, Sergiu
In this paper we prove that it is NP-complete to decide whet- her a graph can be partitioned into nontrivial convex sets. We show that it can be verified in polynomial time whether a graph can be covered by nontrivial convex sets. Also, we propose a re- cursive formula that establishes the maximum nontrivial convex cover number of a tree.
MAXIMUM NONTRIVIAL CONVEX COVER OF A TREE
(CEP USM, 2017) Buzatu, Radu
The nontrivial convex p-cover problem of a tree is studied.We propose the recursive formula that determines the maximum nontrivial convex cover number of a tree.
COVERING UNDIRECTED GRAPHS BY CONVEX SETS
(Valines SRL, 2014) Buzatu, Radu
This paper is focused on some aspects of undirected graphs covering, in particular convex sets problem (CCS) and partitioning undirected graph into convex sets problem (PCS). We prove theorems regarding existence of graphs with fxed number of convex sets which serve as solutions to CCS and PCS problems.