Brooks-type conjecture for proper conflict-free coloring
Statement
Let be a simple finite undirected graph with maximum degree , and let denote its proper conflict-free chromatic number. Brooks-type conjecture. For every graph with maximum degree ,
This conjecture was posed as a Brooks-type bound for proper conflict-free coloring; the supplied text gives no resolution status.
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.