Polynomial-time recognition conjecture for APUD(1,1)
Statement
Let be a graph, and let denote the corresponding graph class of restricted disk intersection graphs.
APUD(1,1) recognition conjecture. Given a graph , it can be determined whether in polynomial time.
The preceding characterization gives necessary structural conditions for connected graphs in , but the source does not establish that they are sufficient. Polynomial-time recognition therefore remains an open problem.
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.