Name
Abstract | ||
|---|---|---|
Correspondence coloring, or DP-coloring, is a generalization of list coloring introduced recently by Dvoak and Postle [11]. In this article, we establish a version of Dirac's theorem on the minimum number of edges in critical graphs [9] in the framework of DP-colorings. A corollary of our main result answers a question posed by Kostochka and Stiebitz [15] on classifying list-critical graphs that satisfy Dirac's bound with equality. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1002/jgt.22227 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
critical graphs,DP-coloring,list coloring | Graph,Discrete mathematics,Combinatorics,List coloring,Dirac (video compression format),Corollary,Mathematics | Journal |
Volume | Issue | ISSN |
88.0 | 3.0 | 0364-9024 |
Citations | PageRank | References |
5 | 0.51 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anton Bernshteyn | 1 | 21 | 3.37 |
| Alexandr V. Kostochka | 2 | 682 | 89.87 |