NP-hardness of testing IC-planarity and NIC-planarity
Statement
A graph is IC-planar if it has a plane drawing in which no two crossings share an endpoint, and NIC-planar if it has a plane drawing in which any two crossings share at most one endpoint. NP-hardness conjecture. Testing whether a graph is IC-planar and testing whether a graph is NIC-planar are NP-hard. The paper notes that testing 1-planarity is already known to be NP-hard, and proposes the analogous complexity classification for IC-planarity and NIC-planarity; the conjecture's resolution is not specified here.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.