DP-colorings of graphs with high chromatic number-Reference-Cited by-同舟云学术

DP-colorings of graphs with high chromatic number

Published:2017-10 Issue: Volume:65 Page:122-129
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Bernshteyn Anton,Kostochka Alexandr,Zhu Xuding

Funder

Illinois Distinguished Fellowship

NSF

Russian Foundation for Basic Research

CNSF

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference10 articles.

1. Colorings and orientations of graphs;Alon;Combinatorica,1992

2. A. Bernshteyn, A. Kostochka, On differences between DP-coloring and list coloring, 2017. arXiv:1705.04883, preprint

3. Z. Dvořák, L. Postle, Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8, 2015. arXiv:1508.03437, preprint

4. Choice number of some complete multi-partite graphs;Enomoto;Discrete Math.,2002

5. P. Erdős, A.L. Rubin, H. Taylor, Choosability in graphs, in: Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congr. Numer. XXVI (1979) 125–157

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Variable Degeneracy on Toroidal Graphs;Graphs and Combinatorics;2023-11-23

2. ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$;Journal of Graph Theory;2023-03-20

3. The DP color function of joins and vertex-gluings of graphs;Discrete Mathematics;2022-11

4. Cover and variable degeneracy;Discrete Mathematics;2022-04

5. DP color functions versus chromatic polynomials;Advances in Applied Mathematics;2022-03