Relaxed DP-3-coloring of planar graphs without some cycles (Q2082416)

Defective colourings, or relaxed colourings, are a generalisation of the usual colourings of graphs: here, instead of looking into a partition of the vertex set into independent sets, one looks for a partition of the vertex set into sets which induce graphs with small maximum degree. Correspondence colourings, or DP-colourings, were introduced by \textit{Z. Dvořák} and \textit{L. Postle} [J. Comb. Theory, Ser. B 129, 38--54 (2018; Zbl 1379.05034)] and are a natural generalisation of list colouring. Combining and generalising both concepts, \textit{P. Sittitrai} and \textit{K. Nakprasit} [Graphs Comb. 35, No. 4, 837--845 (2019; Zbl 1416.05117)] introduced the concept of relaxed DP-colourings of graphs. The paper studies relaxed DP-colourings of planar graphs which do not contain cycles of some prescribed lengths. The main results are that planar graphs without cycles of length \(4\) and \(8\) are DP-\((0, 2, 2)\)-colorable, and the same conclusion holds for planar graphs without cycles of length \(4\) and \(6\).