Author:
Borowiecki Mieczysław,Jendrol’ Stanislav,Král’ Daniel,Miškuf Jozef
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. N. Alon, Restricted colorings of graphs, in: K. Walker (Ed.), Surveys in Combinatorics 1993, London Math. Soc. Lecture Notes Series, vol. 187, Cambridge University Press, Cambridge, 1993, pp. 1–33.
2. Degrees and choice numbers;Alon;Random Structures Algorithms,2000
3. Choosability in graphs;Erdős;Congr. Numer.,1980
4. Asymptotically good list-colorings;Kahn;J. Combin. Theory Ser. A,1996
5. J. Kratochvíl, Zs. Tuza, M. Voigt, New trends in the theory of graph colorings: choosability and list coloring, in: R.L. Graham, J. Kratochvíl, J. Nešetřil, F. Roberts (Eds.), Contemporary Trends in Discrete Mathematics (from DIMACS and DIMATIA to the future), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, AMS, Providence, 1999, pp. 183–197.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献