1,760 research outputs found

    On DP-Coloring of Digraphs

    Get PDF
    DP-coloring is a relatively new coloring concept by Dvo\v{r}\'ak 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 GG with a list-assignment LL to finding an independent transversal in an auxiliary graph with vertex set {(v,c) ∣ v∈V(G),c∈L(v)}\{(v,c) ~|~ v \in V(G), c \in L(v)\}. 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.Comment: 23 pages, 6 figure

    Call Center Capacity Planning

    Get PDF

    Hajós and Ore constructions for digraphs

    Get PDF
    • …
    corecore