TY - JOUR A1 - Bang‐Jensen, Jørgen A1 - Bellitto, Thomas A1 - Schweser, Thomas A1 - Stiebitz, Michael T1 - On DP‐coloring of digraphs JF - Journal of Graph Theory N2 - DP‐coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list‐colorings of (undirected) graphs. It transforms the problem of finding a list‐coloring of a given graph with a list‐assignment to finding an independent transversal in an auxiliary graph with vertex set . In this paper, we extend the definition of DP‐colorings to digraphs using the approach from Neumann‐Lara where a coloring of a digraph is a coloring of the vertices such that the digraph does not contain any monochromatic directed cycle. Furthermore, we prove a Brooks’ type theorem regarding the DP‐chromatic number, which extends various results on the (list‐)chromatic number of digraphs. Y1 - 2025 U6 - https://doi.org/10.1002/jgt.22535 SN - 0364-9024 VL - 95 IS - 1 SP - 76 EP - 98 PB - Wiley ER - TY - JOUR A1 - Bang-Jensen, Jørgen A1 - Bellitto, Thomas A1 - Schweser, Thomas A1 - Stiebitz, Michael T1 - Hajós and Ore Constructions for Digraphs JF - The Electronic Journal of Combinatorics Y1 - 2025 U6 - https://doi.org/10.37236/8942 SN - 1077-8926 VL - 27 IS - 1 PB - The Electronic Journal of Combinatorics ER -