On nontrivial covers and partitions of graphs by convex sets

zbMath1390.05188MaRDI QIDQ1650402

Radu Buzatu, Sergiu Cataranciuc

Publication date: 3 July 2018

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)

Full work available at URL: http://www.math.md/publications/csjm/issues/v26-n1/12563/

zbMATH Keywords

treecomplexityconvexitynontrivial convex covernontrivial convex partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Unnamed Item

This page was built for publication: On nontrivial covers and partitions of graphs by convex sets