On List Colourings and Choosability of Graphs
暂无分享,去创建一个
[1] B. Wirth,et al. On 3-colorable non-4-choosable planar graphs , 1997 .
[2] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[3] Roland Häggkvist,et al. Some upper bounds on the total and list chromatic numbers of multigraphs , 1992, J. Graph Theory.
[4] Fred Galvin,et al. The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.
[5] Zsolt Tuza,et al. Algorithmic complexity of list colorings , 1994, Discret. Appl. Math..
[6] Margit Voigt,et al. List colourings of planar graphs , 2006, Discret. Math..
[7] N. Alon. Restricted colorings of graphs , 1993 .
[8] Sylvain Gravier. A Hajós-like theorem for list coloring , 1996, Discret. Math..
[9] Margit Voigt. Choosability of planar graphs , 1996, Discret. Math..
[10] Alexandr V. Kostochka,et al. The colour theorems of Brooks and Gallai extended , 1996, Discret. Math..
[11] Alexandr V. Kostochka,et al. On kernel-perfect orientations of line graphs , 1998, Discret. Math..
[12] Zsolt Tuza,et al. Every 2-choosable graph is (2m, m)-choosable , 1996, J. Graph Theory.
[13] Zsolt Tuza,et al. Complexity of choosing subsets from color sets , 1998, Discret. Math..
[14] Ewa Drgas-Burchardt,et al. Generalized list colourings of graphs , 1995, Discuss. Math. Graph Theory.
[15] Frédéric Maffray,et al. Kernels in perfect line-graphs , 1992, J. Comb. Theory, Ser. B.
[16] Shai Gutner. The complexity of planar graph choosability , 1996, Discret. Math..
[17] Noga Alon,et al. Choosability and fractional chromatic numbers , 1997, Discret. Math..
[18] K. Appel,et al. Every planar map is four colorable. Part II: Reducibility , 1977 .
[19] Margit Voigt,et al. A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..
[20] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory, Ser. B.