Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]

Abstract In this corrigendum we give a counterexample to Theorem 6 in Penso et al. (2015) [1] . A polynomial time algorithm to determine the P 3 -hull number of a graph with maximum degree three is presented in Takaoka and Ueno (2015) [2] .