Gutin–Kim conjecture on recognizing PC Hamilton cycles
Statement
An edge-colored complete graph is a complete graph whose edges are assigned colors, and a PC Hamilton cycle is a spanning cycle whose consecutive edges have distinct colors.
Gutin–Kim conjecture. It is polynomial-time checkable whether an edge-colored complete graph contains a PC Hamilton cycle.
The paper notes that the conjecture is known for -colored complete graphs via the characterization of Bánkfalvi and Bánkfalvi, while the general case is presented as open. A solution to the stated characterization problem for merging two vertex-disjoint PC cycles would be a major step toward this conjecture.
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.