The DP-coloring problem is a generalization of the list coloring problem introduced by Dvořák and Postle [1]}, defined as follows.
Given a graph \(G\)  and a function \(f:V(G) \rightarrow \mathbb {N}\) , an \(f\) -fold cover of \(G\)  is a graph \(H\)  obtained by the following process:
