The P_12 dichotomy conjecture for coloring problems
Statement
Let be a connected cubic graph, and consider the decision problem that asks, for a connected cubic graph , whether admits an -coloring.
dichotomy conjecture. If admits a -coloring, then the -problem is NP-complete; if does not admit a -coloring, then the -problem is polynomial-time solvable.
This conjecture proposes a complexity dichotomy governed by whether the target graph admits a -coloring. The source presents it as an open problem; no proof of either direction is supplied.
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.