The injective chromatic index conjecture for subcubic graphs
Statement
Let be a subcubic graph, meaning that its maximum degree is at most . The subcubic injective edge-coloring conjecture.
The injective chromatic index is the minimum number of colors in an injective edge coloring, and the conjecture would improve the general bounds known for graphs of maximum degree three. It is attributed in the source to Ferdjallah, Kerdjoudj, and Raspaud.
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.