# Sharp Dirac's theorem for DP-critical graphs

@article{Bernshteyn2018SharpDT, title={Sharp Dirac's theorem for DP-critical graphs}, author={Anton Bernshteyn and Alexandr V. Kostochka}, journal={J. Graph Theory}, year={2018}, volume={88}, pages={521-546} }

Correspondence coloring, or DP-coloring, is a generalization of list coloring introduced recently by Dvořak and Postle. In this paper we establish a version of Dirac's theorem on the minimum number of edges in critical graphs in the framework of DP-colorings. A corollary of our main result answers a question posed by Kostochka and Stiebitz on classifying list-critical graphs that satisfy Dirac's bound with equality.

#### Figures and Topics from this paper

#### 26 Citations

On Differences Between DP-Coloring and List Coloring

- Mathematics
- Siberian Advances in Mathematics
- 2019

DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořak and Postle. Many known upper bounds for the list-chromatic number extend to the… Expand

A note on a Brooks' type theorem for DP?coloring

- Mathematics, Computer Science
- J. Graph Theory
- 2019

Detailed structure when a multigraph does not admit a DP-coloring was not specified in \cite{BKP}. Expand

DP-degree colorable hypergraphs

- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2019

The concept of DP-colorings is extended to hypergraphs having multiple (hyper-)edges and, furthermore, the corresponding 'bad' covers are characterized and a Brooks' type result is given for the DP-chromatic number of a hypergraph. Expand

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

- Mathematics, Computer Science
- J. Comb. Theory, Ser. B
- 2018

It is proved that excluding cycles of lengths 4 to 8 is sufficient to guarantee 3-choosability of a planar graph, thus answering a question of Borodin. Expand

Non-chromatic-adherence of the DP Color Function via Generalized Theta Graphs

- Mathematics
- 2021

DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been widely studied in recent years after its introduction by Dvořák and Postle in 2015. The chromatic… Expand

DP-3-coloring of some planar graphs

- Mathematics, Computer Science
- Discret. Math.
- 2019

A unified approach is used to prove several classes of planar graphs are DP-$3-colorable, which extend the corresponding results on $3$-choosability. Expand

On Polynomial Representations of the DP Color Function: Theta Graphs and Their Generalizations

- Mathematics
- 2020

DP-coloring (also called correspondence coloring) is a generalization of list coloring that has been widely studied in recent years after its introduction by Dvořák and Postle in 2015. As the… Expand

Planar Graphs with the Distance of 6--Cycles at Least 2 from Each Other Are DP-3-Colorable

- Mathematics
- 2020

DP-coloring as a generalization of list coloring was introduced by Dvořak and Postle recently. In this paper, we prove that every planar graph in which the distance between 6−-cycles is at least 2 is… Expand

Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm

- Mathematics
- 2019

Many of the most celebrated and influential results in graph coloring, such as Brooks’ Theorem and Vizing’s Theorem, relate a graph’s chromatic number to its clique number or maximum degree.… Expand

2 0 A ug 2 01 8 DP-Degree Colorable Hypergraphs

- 2018

In order to solve a question on list coloring of planar graphs, Dvořák and Postle [10] introduced the concept of DP-coloring, which shifts the problem of finding a coloring of a graph G from a given… Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

List-coloring embedded graphs without cycles of lengths 4 to 8

- Mathematics
- 2015

The well-known Steinberg's conjecture postulates that every planar graph without 4-cycles and 5-cycles is 3-colorable. The list-coloring version of this claim is known to be false. However, we prove… Expand

On Differences Between DP-Coloring and List Coloring

- Mathematics
- Siberian Advances in Mathematics
- 2019

DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořak and Postle. Many known upper bounds for the list-chromatic number extend to the… Expand

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

- Mathematics, Computer Science
- J. Comb. Theory, Ser. B
- 2018

It is proved that excluding cycles of lengths 4 to 8 is sufficient to guarantee 3-choosability of a planar graph, thus answering a question of Borodin. Expand

Colorings and orientations of graphs

- Mathematics, Computer Science
- Comb.
- 1992

Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques by proving that there is a legal vertex-coloring of G assigning to each vertexv a color fromS(v). Expand

On chromatic-choosable graphs

- Computer Science
- J. Graph Theory
- 2002

It is shown in this article that, for any graph G, if the authors join a sufficiently large complete graph to G, then G is chromaticchoosable and a conjecture related to this fact is proposed. Expand

A list version of Dirac's theorem on the number of edges in colour-critical graphs

- Computer Science
- J. Graph Theory
- 2002

One of the basic results in graph colouring is Brooks' theorem, which states that the colour of a graph is determined by the number ofcolours in the graph. Expand

3-List-Coloring Planar Graphs of Girth 5

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 1995

Abstract We prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to precolor any 5-cycle in the graph. This extension implies Grotzsch′s theorem that every planar… Expand

The colour theorems of Brooks and Gallai extended

- Computer Science, Mathematics
- Discret. Math.
- 1996

A reduction idea is used in order to give a new short proof of Brooks' theorem about chromatic number of connected graphs and to extend it to hypergraphs. Expand

The asymptotic behavior of the correspondence chromatic number

- Mathematics, Computer Science
- Discret. Math.
- 2016

It is proved that for triangle-free G, ź c ( G ) = O ( Δ / ln Δ ) , where Δ is the maximum degree of G (this is a generalization of Johansson's result about list colorings (Johansson, 1996)). Expand

Every Planar Graph Is 5-Choosable

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 1994

We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdos, A. L. Rubin, and H Taylor.