Proper orientation number of triangle‐free bridgeless outerplanar graphs
Proper orientation number of triangle‐free bridgeless outerplanar graphs
Abstract An orientation of is a digraph obtained from by replacing each edge by exactly one of two possible arcs with the same endpoints. We call an orientation proper if neighboring vertices have different in‐degrees. The proper orientation number of a graph , denoted by , is the minimum maximum …