Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants

@article{Schauz2010FlexibleCL,
  title={Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants},
  author={Uwe Schauz},
  journal={Electr. J. Comb.},
  year={2010},
  volume={17}
}
We present a purely combinatorial proof of Alon and Tarsi’s Theorem about list colorings and orientations of graphs. More precisely, we describe a winning strategy for Mrs. Correct in the corresponding coloring game of Mr. Paint and Mrs. Correct. This strategy produces correct vertex colorings, even if the colors are taken from lists that are not completely fixed before the coloration process starts. The resulting strengthening of Alon and Tarsi’s Theorem leads also to strengthening of its… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
16 Citations
17 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Schauz : Mr . Paint and Mrs . Correct

  • U.
  • The Electronic Journal of Combinatorics
  • 2009

Schauz : Algebraically Solvable Problems : Describing Polynomials as Equivalent to Explicit

  • U.
  • Solutions The Electronic Journal of Combinatorics
  • 2008

Schauz : Colorings and Orientations of Matrices and Graphs

  • U.
  • The Electronic Journal of Combinatorics
  • 2006

New Trends in the Theory of Graph Colorings : Choosability and List Coloring

  • Zs. Tuza
  • DIMACS Ser . Discr . Math . Theo . Comp . Sci .
  • 1999

Tarsi : Colorings and Orientations of Graphs

  • M.
  • Combinatorica
  • 1999

Janssen : New Bounds on the ListChromatic Index of the Complete Graph and Other Simple Graphs

  • HäJa R. Häggkvist, J.
  • Combinatorics , Probability and Computing
  • 1997

Similar Papers

Loading similar papers…