Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference36 articles.
1. Becker, J., Hewitt, J., Kaul, H., Maxfield, M., Mudrock, J., Spivey, D., Thomason, S., Wagstrom, T.: The DP color function of joins and vertex-gluings of graphs. Discret. Math. 345, 113093 (2022)
2. Bernshteyn, A.: The asymptotic behavior of the correspondence chromatic number. Discret. Math. 339, 2680–2692 (2016)
3. Bernshteyn, A.: The Johansson-Molloy theorem for DP-coloring. Random Struct. Algorithms 54(4), 653–664 (2019)
4. Bernshteyn, A., Kostochka, A.: Sharp Dirac’s theorem for DP-critical graphs. J. Graph Theory 88, 521–546 (2018)
5. Bernshteyn, A., Kostochka, A.: On differences between DP-coloring and list coloring. Sib. Adv. Math. 21(2), 61–71 (2018)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献