On nontrivial covers and partitions of graphs by convex sets

MaRDI QIDQ1650402zbMATH OpenFDO

Authors Radu Buzatu, Sergiu Cataranciuc

Publication date 3 July 2018

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

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

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

zbMATH Keywords

complexityconvexitynontrivial convex covernontrivial convex partitiontree

Mathematics Subject Classification ID

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) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the computational complexity of optimization convex covering problems of graphs
• Nontrivial convex covers of trees
• Convex graph covers
• Covering graphs with convex sets and partitioning graphs into convex sets
• Convex covers of graphs

Cited in

(11)

• Convex graph covers
• On the computational complexity of optimization convex covering problems of graphs
• Covering graphs with convex sets and partitioning graphs into convex sets
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Convex covers of graphs
• Covering undirected graphs by convex sets
• Convex Partitions of Graphs
• Maximum nontrivial convex cover number of join and corona of graphs
• Nontrivial convex covers of trees
• Convex partitions of graphs induced by paths of order three
• Set cover, set packing and hitting set for tree convex and tree-like set systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650402)