COVERING UNDIRECTED GRAPHS BY CONVEX SETS

Simple item page
dc.contributor.authorBuzatu, Radu
dc.date.accessioned2017-09-27T13:36:13Z
dc.date.available2017-09-27T13:36:13Z
dc.date.issued2014
dc.description.abstractThis 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.en
dc.identifier.citationBUZATU, R. Covering undirected graphs by convex sets. In: The Third Conference of Mathematical Society of the Republic of Moldova: dedicated to the 50th anniversary of the foundation of the Institute of Mathematics and Computer Science, 19-23 aug. 2014, Chisinau, Moldova: Proceedings IMCS-50.Ch., 2014, pp.322-325. ISBN 978-9975-68-244-2en
dc.identifier.isbn978-9975-68-244-2
dc.identifier.urihttps://msuir.usm.md/handle/123456789/1311
dc.language.isoenen
dc.publisherValines SRLen
dc.subjectconvexityen
dc.subjectd-convexityen
dc.subjectgraphsen
dc.subjectconvex coversen
dc.subjectvertex covers.en
dc.titleCOVERING UNDIRECTED GRAPHS BY CONVEX SETSen
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Proceedings_IMCS50.pdf
Size:
18.22 MB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

2. Articole