Buzatu, RaduCataranciuc, Sergiu2018-12-192018-12-192018BUZATU, R., CATARANCIUC, S. On Nontrivial Covers and Partitions of Graphs by Convex Sets. In: Сomputer Science Journal of Moldova. 2018. Nr. 1(76), pp. 3-14. ISSN 1561-40421561-4042https://ibn.idsi.md/sites/default/files/imag_file/3-14.pdfhttps://msuir.usm.md/handle/123456789/1908In 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.enconvexitycomplexitynontrivial convex covertreeArticle