DP-completeness of exact circular chromatic index
Statement
Let be a rational number. For a graph , let denote its circular chromatic index, and let be the decision problem of determining whether .
DP-completeness conjecture. The problem is DP-complete.
The preceding complexity discussion establishes NP-completeness for deciding whether and explains why exact equality also involves a coNP component; the claimed DP-completeness is proposed on that basis.
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.