The diameter of strong orientations of strong products of graphs
Simon \v{S}pacapan, Irena Hrastnik-Ladinek

TL;DR
This paper establishes an improved upper bound on the diameter of strongly connected orientations of strong graph products, reducing previous bounds significantly for connected graphs.
Contribution
It proves a tighter bound on the diameter of strong orientations of strong graph products, improving upon earlier general bounds for connected graphs.
Findings
Diameter of strong orientations is at most 2r+15 for connected graphs.
Improves previous bound of 2r^2+2r for arbitrary graphs.
Results apply specifically to strong products of connected graphs.
Abstract
Let and be graphs, and the strong product of and . We prove that for any connected graphs and there is a strongly connected orientation of such that , where is the radius of .This improves the general bound for arbitrary graphs, proved by Chvtal and Thomassen.
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.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Limits and Structures in Graph Theory
