2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/158333We consider the problem of finding an orientation with minimum diameter of a connected bridgeless graph. Fomin et. al. discovered a relation between the minimum oriented diameter an the size of a minimal dominating set. We improve their upper bound.21 pages, 6 figuresCombinatorics05C12 (Primary);05C20,05C69 (Secondary)text