NP-completeness of the planar graph square-root problem
Statement
A graph is planar if it can be drawn in the plane without edge crossings. For a graph class , the -square-root problem asks whether a given graph has a square root belonging to .
Planar square-root conjecture. The -square-root problem is NP-complete for the class of planar graphs.
The paper proves NP-completeness for the class of -apex graphs, which is minor-closed and lies at the bottom of the bounded-expansion hierarchy. It remains open whether the apex vertices are necessary, or whether the planar square-root problem is already hard.
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.