On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets

We consider strongly connected orientations of the grid graph which has n 1 + 1 eastwest avenues and n 2 + 1 north–south streets. We seek optimal strongly connected orientations according to several different definitions of optimality. In earlier work, such optimal orientations were found for n 1 , n 2 both at least 4 and for n 1 = 1. Here we consider the case n 1 = 2.