An improved upper bound for oriented diameter of graphs with diameter $4$

Yaokun Feng, Hui Lei, Xiaopan Lian +1

Let $f(d)$ denote the smallest integer such that every bridgeless graph of diameter $d$ admits a strong orientation with diameter at most $f(d)$. It is known that $f(2)=6$ and $f(3…