Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles

Maria Axenovich, John Goldwasser, Ryan Hansen +5

If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polych…