Author:
Shen Yu-fa,Wang Feng,Zheng Guo-ping,Ma Li-hua
Publisher
Springer Science and Business Media LLC
Reference17 articles.
1. Enotomo, H., Ohba, K., Ota, K., Sakamoto, J. Choice number of some complete multipartite graphs. Discrete Math., 244: 55–66 (2002)
2. Erdös, P., Rubin, A.L., Taylor, H. Choosability in graphs. Congr. Numer., 26: 125–157 (1979)
3. Gravier, S., Maffray, F. Graphs whose choice number is equal to their chromatic number. J. of Graph Theory, 27: 87–97 (1998)
4. He, W., Zhang, L., Cranston, Daniel W., Shen, Y., Zheng, G. Choice number of complete multipartite graphs K3*3,2*(k-5),1*2 and K4,3*2,2*(k-6),1*3. Discrete Math., 308: 5871–5877 (2008)
5. Kierstead, H.A. On the choosability of complete multipartite graphs with part size three. Discrete Math., 211: 255–259 (2000)