论文信息 - Choice number of 3-colorable elementary graphs

Choice number of 3-colorable elementary graphs

We show that the choice number of a graph G is equal to its chromatic number when G belongs to a restricted class of claw-free graphs, in view of the conjecture that this is true for every claw-free graph.

Sylvain Gravier | Frédéric Maffray

[1] Sylvain Gravier,et al. Graphs whose choice number is equal to their chromatic number , 1998, J. Graph Theory.

[2] Vasek Chvátal,et al. Recognizing claw-free perfect graphs , 1987, J. Comb. Theory, Ser. B.

[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] Bruce A. Reed,et al. A Description of Claw-Free Perfect Graphs , 1999, J. Comb. Theory, Ser. B.