Proper Hamiltonian cycles in 2-connected edge-colored multigraphs
Statement
Let be a -connected -edge-colored multigraph on vertices, where and . Let denote its rainbow degree and let be its number of edges. Proper Hamiltonian cycle conjecture. If
and
then has a proper Hamiltonian cycle. This conjecture proposes an edge-count condition, together with 2-connectivity and maximum rainbow degree, sufficient to guarantee a proper Hamiltonian cycle in an edge-colored multigraph.
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.