Generalised Thue chromatic index bound for Jaco graphs
Statement
Let be a Jaco graph, where
with , , and . Write for its Thue chromatic index, and let and denote its maximum and minimum degrees, respectively.
Generalised Jaco graph conjecture. For every such Jaco graph,
This conjecture generalises the preceding bound for the considered Jaco graphs by relating the Thue chromatic index to both the maximum and minimum degrees. The source provides no resolution, so the conjecture remains open.
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.