Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs

J. Ai, S. Gerke, G. Gutin +2

An orientation of $G$ is a digraph obtained from $G$ by replacing each edge by exactly one of two possible arcs with the same endpoints. We call an orientation \emph{proper} if nei…