A simple competitive graph coloring algorithm II
Tài liệu tham khảo
Bodlaender, 1991, On the complexity of some coloring games, Vol. 484, 30
Cai, 2001, Game chromatic index of k-degenerate graphs, J. Graph Theory, 36, 144, 10.1002/1097-0118(200103)36:3<144::AID-JGT1002>3.0.CO;2-F
Chen, 1993, Graphs with linearly bounded Ramsey numbers, J. Combin. Theory Ser. B, 57, 138, 10.1006/jctb.1993.1012
Chou, 2003, Relaxed game chromatic number of graphs, Discrete Math., 262, 89, 10.1016/S0012-365X(02)00521-6
Cowen, 1986, Defective colorings of graphs in surfaces, J. Graph Theory, 10, 187, 10.1002/jgt.3190100207
Cowen, 1997, Defective coloring revisited, J. Graph Theory, 24, 205, 10.1002/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T
Deuber, 1998, Relaxed coloring of a graph, Graphs Combin., 14, 121, 10.1007/s003730050020
Dinski, 1999, A bound for the game chromatic number of graphs, Discrete Math., 196, 109, 10.1016/S0012-365X(98)00197-6
C. Lundon, H. Kierstead, A simple competitive graph coloring algorithm III, manuscript, 2002.
Eaton, 1999, Defective list colorings of planar graphs, Bull. Inst. Combin. Appl., 25, 79
Faigle, 1993, On the game chromatic number of some classes of graphs, Ars Combin., 35, 143
Guan, 1999, Game chromatic number of outerplanar graphs, J. Graph Theory, 30, 67, 10.1002/(SICI)1097-0118(199901)30:1<67::AID-JGT7>3.0.CO;2-M
Kierstead, 2000, A simple competitive graph coloring algorithm, J. Combin. Theory Ser. B, 78, 57, 10.1006/jctb.1999.1927
Kierstead, 1994, Planar graph coloring with an uncooperative partner, J. Graph Theory, 18, 569, 10.1002/jgt.3190180605
Kierstead, 2001, Competitive colorings of oriented graphs, Electron. J. Combin., 8, 15
Kierstead, 2003, Marking games and the oriented game chromatic number of partial k-trees, Graphs Combin., 19, 121, 10.1007/s00373-002-0489-5
Nešetřil, 2001, On the oriented game chromatic number, Electron. J. Combin., 8, 13
Škrekovski, 1999, List improper colourings of planar graphs, Combin. Probab. Comput., 8, 293, 10.1017/S0963548399003752
Zhu, 1999, Game coloring number of planar graphs, J. Combin. Theory Ser. B, 75, 245, 10.1006/jctb.1998.1878
Zhu, 2000, The game coloring number of pseudo partial k-trees, Discrete Math., 215, 245, 10.1016/S0012-365X(99)00237-X