Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs

DOI10.1016/j.tcs.2017.08.013zbMath1382.68097OpenAlexW2751523606MaRDI QIDQ1680540

Dieter Rautenbach, Uéverton dos Santos Souza, Lucia Draque Penso, Fábio Protti

Publication date: 16 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.08.013

zbMATH Keywords

subcubic graphs\(P_3\)-hull number\(P_3\)-hull setirreversible 2-conversion set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs ⋮ \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers ⋮ The hull number in the convexity of induced paths of order \(3\)

Cites Work

• Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs

This page was built for publication: Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs