COVERING UNDIRECTED GRAPHS BY CONVEX SETS
Date
2014
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Valines SRL
Abstract
This 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.
Description
Keywords
convexity, d-convexity, graphs, convex covers, vertex covers.
Citation
BUZATU, 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-2