The Complexity of $(P_k,P_{\ell })$-Arrowing

Zohair Raza Hassan, Edith Hemaspaandra, Stanisław Radziszowski

For fixed nonnegative integers $k$ and $\ell$, the $(P_k,P_{\ell })$-Arrowing problem asks whether a given graph, $G$, has a red/blue coloring of $E(G)$ such that there are no red co…