Conjecture on the injective chromatic index of subcubic graphs
Statement
Let be a subcubic graph, meaning a graph with maximum degree at most . The injective chromatic index, denoted by , is the minimum number of colors in an injective edge-coloring of . Subcubic injective edge-coloring conjecture. For every subcubic graph,
The preceding theorem gives the weaker upper bound , while the complete graph supplies a lower-bound example; the proposed improvement is left unresolved in the supplied source.
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.