@article{Bang‐JensenBellittoSchweseretal.2019, author = {Bang-Jensen, J{\o}rgen and Bellitto, Thomas and Schweser, Thomas and Stiebitz, Michael}, title = {On DP-coloring of digraphs}, series = {Journal of Graph Theory}, volume = {95}, journal = {Journal of Graph Theory}, number = {1}, publisher = {Wiley}, issn = {0364-9024}, doi = {10.1002/jgt.22535}, pages = {76 -- 98}, year = {2019}, abstract = {DP-coloring is a relatively new coloring concept by Dvoř{\´a}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.}, language = {en} } @article{BangJensenBellittoSchweseretal.2020, author = {Bang-Jensen, J{\o}rgen and Bellitto, Thomas and Schweser, Thomas and Stiebitz, Michael}, title = {Haj{\´o}s and Ore Constructions for Digraphs}, series = {The Electronic Journal of Combinatorics}, volume = {27}, journal = {The Electronic Journal of Combinatorics}, number = {1}, publisher = {The Electronic Journal of Combinatorics}, issn = {1077-8926}, doi = {10.37236/8942}, year = {2020}, language = {en} }