On chromatic-choosable graphs
暂无分享,去创建一个
A graph is chromatic-choosable if its choice number coincides with its chromatic number. It is shown in this article that, for any graph G, if we join a sufficiently large complete graph to G, then we obtain a chromatic-choosable graph. As a consequence, if the chromatic number of a graph G is close enough to the number of vertices in G, then G is chromatic-choosable. We also propose a conjecture related to this fact. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 130–135, 2002
[1] Roland Häggkvist,et al. Some upper bounds on the total and list chromatic numbers of multigraphs , 1992, J. Graph Theory.
[2] Sylvain Gravier,et al. Choice number of 3-colorable elementary graphs , 1997, Discret. Math..
[3] Fred Galvin,et al. The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.
[4] P. Hall. On Representatives of Subsets , 1935 .
[5] Hikoe Enomoto,et al. Choice number of some complete multi-partite graphs , 2002, Discret. Math..