Subcubic semistrong chromatic index conjecture
Statement
Let be a connected graph with maximum degree , let be the complete bipartite graph, let the -prism be the graph named in the source, and let denote the semistrong chromatic index of . Subcubic semistrong index conjecture. If is distinct from and the -prism, then
The conjecture is motivated by the claim that the -prism is the only known connected subcubic graph with semistrong chromatic index , together with computational verification for small subcubic graphs; no resolution 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.