Xiaonan Liu

Improved bounds on the oriented diameter of planar triangulations

The oriented diameter of a connected bridgeless graph $G$, denoted by $\overrightarrow{\operatorname{diam}}(G)$, is the minimum diameter among all strong orientations of $G$. We study the oriented diameter of planar triangulations, and show that $\overrightarrow{\operatorname{diam}}(G)\leq \frac{2n+44}{5}$ for any $n$-...