scientific article; zbMATH DE number 6254007

zbMath1280.68095MaRDI QIDQ5396751

Dieter Rautenbach, Mitre C. Dourado, Carmen C. Centeno, Simone Dantas, Jayme Luiz Szwarcfiter

Publication date: 3 February 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1519/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph convexityconvex partition

Mathematics Subject Classification ID

Paths and cycles (05C38) 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) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Complexity aspects of the triangle path convexity ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ A general framework for path convexities ⋮ Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs ⋮ On the Carathéodory number of interval and graph convexities ⋮ On the \(P_3\)-hull number of Hamming graphs ⋮ Domination and convexity problems in the target set selection model ⋮ The Carathéodory number of the \(P_3\) convexity of chordal graphs ⋮ Graphs with few \(P_4\)'s under the convexity of paths of order three ⋮ Inapproximability results for graph convexity parameters ⋮ Unnamed Item ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ On the \(P_3\)-hull number of Kneser graphs ⋮ Covering graphs with convex sets and partitioning graphs into convex sets