Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.
The Electronic Journal of Combinatorics [electronic only] (2010)
- Volume: 17, Issue: 1, page Research Paper R13, 18 p.-Research Paper R13, 18 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topSchauz, Uwe. "Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.." The Electronic Journal of Combinatorics [electronic only] 17.1 (2010): Research Paper R13, 18 p.-Research Paper R13, 18 p.. <http://eudml.org/doc/231503>.
@article{Schauz2010,
author = {Schauz, Uwe},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Alon and Tarsi's theorem; list coloring and orientation of graphs; combinatoric; time scheduling with unreliable participants},
language = {eng},
number = {1},
pages = {Research Paper R13, 18 p.-Research Paper R13, 18 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.},
url = {http://eudml.org/doc/231503},
volume = {17},
year = {2010},
}
TY - JOUR
AU - Schauz, Uwe
TI - Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2010
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 17
IS - 1
SP - Research Paper R13, 18 p.
EP - Research Paper R13, 18 p.
LA - eng
KW - Alon and Tarsi's theorem; list coloring and orientation of graphs; combinatoric; time scheduling with unreliable participants
UR - http://eudml.org/doc/231503
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.