Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.
Schauz, Uwe
The Electronic Journal of Combinatorics [electronic only], Tome 17 (2010), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2010-01-01
EUDML-ID : urn:eudml:doc:231503 
@article{05686995,
     title = {Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {17},
     year = {2010},
     zbl = {1192.91045},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05686995}
}

Schauz, Uwe. Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.. The Electronic Journal of Combinatorics [electronic only], Tome 17 (2010) . http://gdmltest.u-ga.fr/item/05686995/