An improvement to Chvátal and Thomassen's upper bound for oriented diameter
From MaRDI portal
Publication:2231791
DOI10.1016/j.dam.2021.08.021zbMath1473.05074arXiv2001.03448OpenAlexW2999840244MaRDI QIDQ2231791
Deepak Rajendraprasad, Jasine Babu, Sai Nishanth Vaka, Deepu Benson
Publication date: 30 September 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.03448
Related Items (5)
Optimal oriented diameter of graphs with diameter 3 ⋮ Improved bounds for the oriented radius of mixed multigraphs ⋮ Oriented diameter of graphs with given girth and maximum degree ⋮ The oriented diameter of graphs with given connected domination number and distance domination number ⋮ Large girth and small oriented diameter graphs
Cites Work
- Improved bound on the oriented diameter of graphs with given minimum degree
- Diameter and maximum degree in Eulerian digraphs
- Oriented diameter of graphs with diameter 3
- Distances in orientations of graphs
- Radius, diameter, and minimum degree
- AT-free graphs: Linear bounds for the oriented diameter
- Diameter of orientations of graphs with given minimum degree
- Minimizing the Oriented Diameter of a Planar Graph
- Strongly connected orientations of mixed multigraphs
- Complexity of approximating the oriented diameter of chordal graphs
- An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
- Oriented diameter and rainbow connection number of a graph
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
This page was built for publication: An improvement to Chvátal and Thomassen's upper bound for oriented diameter
