1.
Schauz U. Flexible Color Lists in Alon and Tarsi’s Theorem, and Time Scheduling with Unreliable Participants. Electron. J. Combin. [Internet]. 2010Jan.5 [cited 2026Mar.27];17(1):R13. Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r13