Tout–Dabboucy–Howalla conjecture on prime labelings of 2-regular graphs
Statement
Let be a -regular graph, where each , and let a graph be prime when it admits a labeling by distinct integers from such that adjacent vertices receive relatively prime labels. Tout–Dabboucy–Howalla conjecture. The graph is prime if and only if at most one of the integers is odd. The necessity is immediate from the independence number, and several partial cases are known; the full classification remains open in the 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.