On the proper orientation number of chordal graphs

Julio Araujo, Alexandre Cezar, Carlos V. G. C. Lima +2

An orientation $D$ of a graph $G=(V,E)$ is a digraph obtained from $G$ by replacing each edge by exactly one of the two possible arcs with the same end vertices. For each $v \in V(…