Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Alon, N.: Choice numbers of graphs; a probabilistic approach. Comb. Probab. Comput. 1, 107–114 (1992)
2. Alon, N.: Degrees and choice numbers. Random Struct. Algor. 16, 364–368 (2000)
3. Erdős, P.: Problem 9. In: Fiedler, M. (ed) Theory of graphs and its applications, Proc. Sympos., Smolenice, 1963, Publ. House Czechoslovak Acad. Sci. Prague, 159. (1964)
4. Erdős, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congressus Numerantium 26, 125–127 (1979)
5. Fűredi, Z., Kantor, I.: List colorings with distinct list sizes, the case of complete bipartite graphs. J. Graph Theory 82(2), 218–227 (2016)