An improved upper bound on the oriented diameter of graphs with diameter $4$
Jifu Lin, Lihua You

TL;DR
This paper improves the upper bound on the oriented diameter of bridgeless graphs with diameter 4 from 21 to 18, advancing understanding of graph orientations.
Contribution
It provides a tighter upper bound on the oriented diameter for graphs with diameter 4, refining previous bounds.
Findings
Improved upper bound of f(4) to 18
Confirmed f(3)=9 for graphs with diameter 3
Reviewed previous bounds for f(d) in literature
Abstract
Let be the smallest value for which every bridgeless graph with diameter admits a strong orientation such that the diameter of is at most . Chv\'atal and Thomassen (1978) established general bounds for which implies , and proved . Kwok et al. (2010) proved that . Wang and Chen (2022) determined . Babu et al. (2021) showed . In this paper, we improve the upper bound of to .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
