The Computational Complexity of Cycle Convexity Parameters in Graphs

The computational complexity of determining the interval number, hull number, rank, and convexity number in the cycle convexity of graphs is analyzed, showing that these problems are NP-complete and W[1]-hard.