Author:
Wang Wei,Qian Jianguo,Yan Zhidan
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference23 articles.
1. Carraher, J., Loeb, S., Mahoney, T., Puleo, G.J., Tsai, M.-T., West, D.B.: Three topics in online list coloring. J. Comb. 5, 115–130 (2014)
2. Enomote, H., Ohba, K., Ota, K., Sakamoto, J.: Choice number of some complete multi-partite graphs. Discrete Math. 244, 55–66 (2002)
3. Erdős, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congr. Numer. 26, 125–157 (1979)
4. Gravier, S., Maffray, F.: Graphs whose choice number is equal to their chromatic number. J. Graph Theory 27, 87–97 (1998)
5. Huang, P.-Y., Wong, T., Zhu, X.: Application of polynomial method to on-line list colouring of graphs. Eur. J. Comb. 33, 872–883 (2012)