Abstract

We consider the problem of finding the minimum diameter among all strong orientations of a given connected, bridgeless, undirected graph. We obtain some bounds for the smallest diameter for different classes of AT-free graphs and show that these bounds are sharp up to additive constants. Dominating sets and their properties are the main tools in our research.