Sárközy, Gábor N., and Stanley Selkow. 2000. “On Edge Colorings With at Least Q Colors in Every Subset of P Vertices”. The Electronic Journal of Combinatorics 8 (1), R9. https://doi.org/10.37236/1553.