An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter

DOI10.1007/978-3-030-50026-9_8MaRDI QIDQ5042233zbMATH OpenOpenAlexFDO

Authors Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka

Publication date 19 October 2022

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-50026-9_8

zbMATH Keywords

strong orientationoriented diameterone-way traffic problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• AT-free graphs: Linear bounds for the oriented diameter
• Complexity of approximating the oriented diameter of chordal graphs
• Diameter of orientations of graphs with given minimum degree
• Distances in orientations of graphs
• Improved bound on the oriented diameter of graphs with given minimum degree
• Minimizing the oriented diameter of a planar graph
• Oriented diameter and rainbow connection number of a graph
• Oriented diameter of graphs with diameter 3
• Strongly connected orientations of mixed multigraphs

Cited in

(4)

• On oriented diameter of \((n, k)\)-star graphs
• Oriented diameter of maximal outerplanar graphs
• An improvement to Chvátal and Thomassen's upper bound for oriented diameter
• Improvement on 2-chains inside thin subsets of Euclidean spaces

This page was built for publication: An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042233)