Improved bound on the oriented diameter of graphs with given minimum degree

DOI10.1016/j.ejc.2016.08.006zbMath1348.05068OpenAlexW2509587582MaRDI QIDQ326665

Michel Surmacs

Publication date: 12 October 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2016.08.006

zbMATH Keywords

bridgeless graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (11)

An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter ⋮ Optimal oriented diameter of graphs with diameter 3 ⋮ A size condition for diameter two orientable graphs ⋮ Improved bounds for the oriented radius of mixed multigraphs ⋮ Oriented diameter of maximal outerplanar graphs ⋮ 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 ⋮ A degree condition for diameter two orientability of graphs ⋮ An improvement to Chvátal and Thomassen's upper bound for oriented diameter ⋮ Diameter three orientability of bipartite graphs

Cites Work

• Unnamed Item
• 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
• Optimal orientations of graphs and digraphs: A survey
• Diameter of orientations of graphs with given minimum degree
• Strongly connected orientations of mixed multigraphs
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• Complexity of approximating the oriented diameter of chordal graphs
• Bounds for the minimum oriented diameter
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: Improved bound on the oriented diameter of graphs with given minimum degree