Hereditary NP-completeness of cubic-graph coloring targets
Statement
Let be a connected cubic graph. The -problem asks, for a connected cubic graph , whether admits an -coloring. Let be the class of connected cubic graphs for which the -problem is NP-complete.
Hereditary-class conjecture. The class is a hereditary class of cubic graphs.
The source motivates this conjecture by comparing the complexity of the -problem for several target graphs, including , , and . Its status is left open in the supplied text.
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.