Inapproximability results related to monophonic convexity

• DOI: 10.1016/j.dam.2014.09.012
• Publication Date: 2014-10-09T18:42:11Z
• Authors: Eurinardo R. Costa; Mitre C. Dourado; Rudini M. Sampaio
• Keywords: Convexity; Clique; Treewidth

In 2010, it was proved that the interval number and the convexity number on the monophonic convexity are NP-hard on general graphs (Dourado et?al., 2010). In this paper, we extend this results on the monophonic convexity. We prove that deciding if the interval number is at most 2 and deciding if the percolation time is at most 1 are NP-complete problems even in bipartite graphs. We also prove that the convexity number is as hard to approximate as the maximum clique problem. Finally, we obtain polynomial time algorithms to determine the convexity number on hereditary graph classes such that the computation of the clique number is polynomial time solvable (as perfect graphs and planar graphs).