Generalized DP-colorings of graphs (Q6091813)

In this paper, the authors present generalizations of various classical coloring results. For this, the authors extend three coloring concepts for the class of finite graphs (with multiple edges allowed and no loops). They are the generalized coloring concept, in which the same colored vertices of a graph induce a subgraph satisfying a prescribed graph property; the concept of variable degeneracy [\textit{O. V. Borodin} et al., ibid. 214, No. 1--3, 101--112 (2000; Zbl 0949.05029)], which makes it possible to give a common generalization of the point partition number and the list chromatic number; and the \(DP\)-coloring concept [\textit{Z. Dvořák} and \textit{L. Postle}, J. Comb. Theory, Ser. B 129, 38--54 (2018; Zbl 1379.05034)], where a list assignment of a graph is replaced by a cover. Combining these three coloring concepts the authors present generalizations of various classical coloring results, such as the theorems of \textit{R. L. Brooks} [Proc. Camb. Philos. Soc. 37, 194--197 (1941; Zbl 0027.26403)], of \textit{T. Gallai} [Publ. Math. Inst. Hung. Acad. Sci., Ser. A 8, 165--192 (1963; Zbl 0121.18401)], and of \textit{P. Erdős} et al. [in: Proceedings of the West Coast Conference on combinatorics, graph theory and computing, Humboldt State University, Arcata, California, September 5--7, 1979. Winnipeg, MB: Utilitas Mathematica Publishing Inc. 125--157 (1980; Zbl 0469.05032)]. Their main result is a \(DP\)-version of a theorem about partitions of graphs into a fixed number of induced subgraphs with bounded variable degeneracy due to Borodin et al. [loc. cit.].