scholarly journals Generalized sum list colorings of graphs

2019 ◽  
Vol 39 (3) ◽  
pp. 689 ◽  
Author(s):  
Arnfried Kemnitz ◽  
Massimiliano Marangio ◽  
Margrit Voigt
Keyword(s):  
List Colorings

scholarly journals Equitable and equitable list colorings of graphs

2010 ◽  
Vol 411 (43) ◽  
pp. 3873-3876 ◽  
Author(s):  
Junlei Zhu ◽  
Yuehua Bu
Keyword(s):  
List Colorings

scholarly journals List colorings and reducibility

1997 ◽  
Vol 79 (1-3) ◽  
pp. 247-256 ◽  
Author(s):  
Zs. Tuza ◽  
M. Voigt
Keyword(s):  
List Colorings

scholarly journals Algorithmic complexity of list colorings

1994 ◽  
Vol 50 (3) ◽  
pp. 297-302 ◽  
Author(s):  
Jan Kratochvíl ◽  
Zsolt Tuza
Keyword(s):  
Algorithmic Complexity ◽  
List Colorings

scholarly journals List colorings with measurable sets

2008 ◽  
Vol 59 (3) ◽  
pp. 229-238
Author(s):  
Jan Hladký ◽  
Daniel Kráal ◽  
Jean-Sébastien Sereni ◽  
Michael Stiebitz
Keyword(s):  
List Colorings

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

10.37236/285 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Uwe Schauz
Keyword(s):  
Winning Strategy ◽  
Real Life ◽  
Bipartite Graphs ◽  
Upper Bounds ◽  
Combinatorial Proof ◽  
Complete Graphs ◽  
Scheduling Problem ◽  
Chromatic Numbers ◽  
List Colorings ◽  
Time Scheduling

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 numerous repercussions. For example we study upper bounds for list chromatic numbers of bipartite graphs and list chromatic indices of complete graphs. As real life application, we examine a chess tournament time scheduling problem with unreliable participants.

scholarly journals Equitable list colorings of planar graphs without short cycles

2008 ◽  
Vol 407 (1-3) ◽  
pp. 21-28 ◽  
Author(s):  
Junlei Zhu ◽  
Yuehua Bu
Keyword(s):  
Planar Graphs ◽  
List Colorings

scholarly journals List Colorings of K5-Minor-Free Graphs With Special List Assignments

2011 ◽  
Vol 71 (1) ◽  
pp. 18-30 ◽  
Author(s):  
Daniel W. Cranston ◽  
Anja Pruchnewski ◽  
Zsolt Tuza ◽  
Margit Voigt
Keyword(s):  
List Colorings ◽  
Minor Free Graphs

scholarly journals List colorings of multipartite hypergraphs

2019 ◽  
Vol 55 (4) ◽  
pp. 950-979
Author(s):  
Arès Méroueh ◽  
Andrew Thomason
Keyword(s):  
List Colorings
Sign in / Sign up

Export Citation Format

Share Document