<?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'>Nontrivial convex covers of trees</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2016</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1024-7696</relatedIdentifier>
<subjects>
<subject>Convexity</subject>
<subject>convex cover</subject>
<subject>convex partition</subject>
<subject>Tree</subject>
<subject>graph</subject>
<subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>517.982.2+519.85</subject>
</subjects>
<dates>
<date dateType='Issued'>2016-12-22</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>We establish conditions for the existence of nontrivial convex covers and nontrivial convex partitions of trees. We prove that a tree G on n ≥ 4 vertices has a nontrivial convex p-cover for every p, 2 ≤ p ≤ 'max cn (G). Also, we prove that it can be decided in polynomial time whether a tree on n ≥ 6 vertices has a nontrivial convex p-partition, for a fixed p, 2 ≤ p ≤ ⌊ n 3 ⌋. </description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>