Sárközy, Gábor N., and Stanley Selkow. “On Edge Colorings With at Least Q Colors in Every Subset of P Vertices”. The Electronic Journal of Combinatorics 8, no. 1 (December 7, 2000): R9. Accessed March 27, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v8i1r9.