Funder
National Security Agency
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica 12, 125–134 (1992)
2. Bernshteyn, A., Kostochka, A.: On differences between DP-coloring and list coloring (2019).
arXiv:1705.04883
(Preprint)
3. Dvořák, Z., Postle, L.: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. J. Comb. Theory Ser. B 129, 38–54 (2018)
4. Erdős, P., Rubin, A.L., Taylor, H.: Choosability in graphs, Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. XXVI, pp. 125–157 (1979)
5. Liu, R., Li, X.: Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. Discrete Math. 342, 623–627 (2019)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献