A sufficient condition for DP-4-colorability

DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each $k \in \{3, 4, 5, 6\}$, every planar graph without $C_k$ is 4-choosable. Furthermore, Jin, Kang, and Steffen \cite{JKS} showed that for each $k \in \{3, 4, 5, 6\}$, every signed planar graph without $C_k$ is signed 4-choosable. In this paper, we show that for each $k \in \{3, 4, 5, 6\}$, every planar graph without $C_k$ is 4-DP-colorable, which is an extension of the above results.

[1]  Bojan Mohar,et al.  Planar Graphs Without Cycles of Specific Lengths , 2002, Eur. J. Comb..

[2]  Carsten Thomassen,et al.  Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[3]  Ko-Wei Lih,et al.  Choosability and edge choosability of planar graphs without five cycles , 2002, Appl. Math. Lett..

[4]  Ying-li Kang,et al.  Circular coloring of signed graphs , 2018, J. Graph Theory.

[5]  Margit Voigt,et al.  List colourings of planar graphs , 2006, Discret. Math..

[6]  N. Alon.  Degrees and choice numbers , 2000 .

[7]  Alexandr V. Kostochka,et al.  On DP-coloring of graphs and multigraphs , 2017 .

[8]  Baogang Xu,et al.  The 4-Choosability of Plane Graphs without 4-Cycles' , 1999, J. Comb. Theory, Ser. B.

[9]  Alexandr Kostochka,et al.  On Differences Between DP-Coloring and List Coloring , 2017, Siberian Advances in Mathematics.

[10]  Thomas Zaslavsky,et al.  Signed graph coloring , 1982, Discret. Math..

[11]  Ying-li Kang,et al.  Choosability in signed planar graphs , 2016, Eur. J. Comb..

[12]  Anton Bernshteyn,et al.  The asymptotic behavior of the correspondence chromatic number , 2016, Discret. Math..

[13]  André Raspaud,et al.  The Chromatic Number of a Signed Graph , 2014, Electron. J. Comb..

[14]  Margit Voigt,et al.  A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..

[15]  Luke Postle,et al.  Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 , 2015, J. Comb. Theory B.

[16]  Margit Voigt.  A non-3-choosable planar graph without cycles of length 4 and 5 , 2007, Discret. Math..

[17]  Alexandr V. Kostochka,et al.  Sharp Dirac's theorem for DP‐critical graphs , 2016, J. Graph Theory.

[18]  Alexandr V. Kostochka,et al.  DP-colorings of graphs with high chromatic number , 2017, Eur. J. Comb..

[19]  Ying-li Kang,et al.  The chromatic spectrum of signed graphs , 2016, Discret. Math..

[20]  Seog-Jin Kim,et al.  A note on a Brooks' type theorem for DP‐coloring , 2017, J. Graph Theory.