Partial DP-coloring of graphs

[1]  William Staton,et al.  Lower Bounds For Induced Forests in Cubic Graphs , 1987, Canadian Mathematical Bulletin.

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

[3]  Gary MacGillivray,et al.  Bounds For Partial List Colourings , 2003, Ars Comb..

[4]  Michael O. Albertson,et al.  The chromatic difference sequence of a graph , 1980, J. Comb. Theory, Ser. B.

[5]  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.

[6]  Moharram N. Iradmusa.  A note on partial list coloring , 2008, Australas. J Comb..

[7]  Gexin Yu,et al.  DP-3-coloring of some planar graphs , 2018, Discret. Math..

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

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

[10]  Jeannette C. M. Janssen,et al.  Partial List Colouring of Certain Graphs , 2015, Electron. J. Comb..

[11]  Jeffrey A. Mudrock.  A note on the DP-chromatic number of complete bipartite graphs , 2018, Discret. Math..

[12]  Seog-Jin Kim,et al.  A sufficient condition for DP-4-colorability , 2017, Discret. Math..

[13]  Hemanshu Kaul,et al.  Combinatorial Nullstellensatz and DP-coloring of graphs , 2020, Discret. Math..

[14]  Chun-Hung Liu,et al.  Minimum size of feedback vertex sets of planar graphs of girth at least five , 2016, Eur. J. Comb..

[15]  Margit Voigt,et al.  Algorithmic Aspects of Partial List Colourings , 2000, Combinatorics, Probability and Computing.

[16]  Hemanshu Kaul,et al.  On the Chromatic Polynomial and Counting DP-Colorings , 2019, Adv. Appl. Math..

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

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

[19]  Alexandr V. Kostochka,et al.  DP-colorings of hypergraphs , 2018, Eur. J. Comb..

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

[21]  Xiangwen Li,et al.  Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable , 2019, Discret. Math..

[22]  Michael O. Albertson,et al.  Partial list colorings , 2000, Discret. Math..

[23]  Anton Bernshteyn,et al.  The Johansson‐Molloy theorem for DP‐coloring , 2017, Random Struct. Algorithms.

[24]  Xiaoyun Lu,et al.  On the maximum induced forests of a connected cubic graph without triangles , 1990, Discret. Math..