MAXIMUM NONTRIVIAL CONVEX COVER OF A TREE

Buzatu, Radu

dc.contributor.author	Buzatu, Radu
dc.date.accessioned	2018-02-26T13:00:16Z
dc.date.available	2018-02-26T13:00:16Z
dc.date.issued	2017
dc.identifier.citation	BUZATU, R. Maximum nontrivial convex cover of a tree. In: In: The Fourth Conference of Mathematical Society of the Republic of Moldova dedicated to the centenary of V. Andrunachievici (1917-1997): Proceeding CMSM4, June28-July2, 2017. Ch.: CEP USM, 2017, pp.365-368 ISBN 978-9975-71-915-5	en
dc.identifier.isbn	978-9975-71-915-5
dc.identifier.uri	http://dspace.usm.md:8080/xmlui/handle/123456789/1661
dc.description.abstract	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.	en
dc.language.iso	en	en
dc.publisher	CEP USM	en
dc.subject	convexity	en
dc.subject	nontrivial convex cover	en
dc.subject	tree	en
dc.title	MAXIMUM NONTRIVIAL CONVEX COVER OF A TREE	en
dc.type	Article	en