<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Buzatu, R.</creatorName>
<affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation>
</creator>
<creator>
<creatorName>Cataranciuc, S.G.</creatorName>
<affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>On Nontrivial Covers and Partitions of Graphs by Convex Sets</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2018</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier>
<subjects>
<subject>Convexity</subject>
<subject>complexity</subject>
<subject>nontrivial convex cover</subject>
<subject>nontrivial convex partition</subject>
<subject>tree.</subject>
<subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>510.51+519.7</subject>
</subjects>
<dates>
<date dateType='Issued'>2018-03-31</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>In this paper we prove that it is NP-complete to decide whether 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 recursive formula that establishes the maximum nontrivial convex cover number of a tree.</p></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>