Frieze Reed, Bruce A. Polychromatic Hamilton cycles Abstract: "The edges of the complete graph K[subscript n] are coloured so that no colour appears no more than k times, k = [n/A 1n n], for some sufficiently large A. We show that there is always a Hamiltonian cycle in which each edge is a different colour. The proof technique is probabilistic." Map-coloring problem.;Hamiltonian graph theory. 1991-01-01
    https://kilthub.cmu.edu/articles/journal_contribution/Polychromatic_Hamilton_cycles/6479141
10.1184/R1/6479141.v1