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

- Maria Axenovich, John Goldwasser, +5 authors Michael Young
- Journal of Graph Theory
- 2018

Given a subgraph G of the hypercube Qn, a coloring of the edges of Qn such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The maximum number of colors with which it is possible to G-polychromatically color the edges of any hypercube is called the polychromatic number of G. To determine polychromatic numbers… (More)