Colorings of oriented planar graphs avoiding a monochromatic subgraph

Helena Bergold, Winfried Hochstättler, Raphael Steiner

For a fixed simple digraph $F$ and a given simple digraph $D$, an $F$-free $k$-coloring of $D$ is a vertex-coloring in which no induced copy of $F$ in $D$ is monochromatic. We stud…