Diameter of orientations of graphs with given minimum degree

DOI10.1016/j.ejc.2015.03.003zbMath1315.05041OpenAlexW2028252104MaRDI QIDQ2349963

Peter Dankelmann, Sheng Bau

Publication date: 18 June 2015

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

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

zbMATH Keywords

bridgeless graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (14)

An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter ⋮ Improved bound on the oriented diameter of graphs with given minimum degree ⋮ 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 ⋮ Diameter and maximum degree in Eulerian digraphs ⋮ Unnamed Item ⋮ A degree condition for diameter two orientability of graphs ⋮ An improvement to Chvátal and Thomassen's upper bound for oriented diameter ⋮ Strongly connected multivariate digraphs ⋮ Diameter three orientability of bipartite graphs

Cites Work

• The orientation number of two complete graphs with linkages
• Oriented diameter of graphs with diameter 3
• Distances in orientations of graphs
• Radius, diameter, and minimum degree
• Minimizing and maximizing the diameter in orientations of graphs
• Orientations of digraphs almost preserving diameter
• AT-free graphs: Linear bounds for the oriented diameter
• Almost minimum diameter orientations of semicomplete multipartite and extended digraphs
• Optimal orientations of graphs and digraphs: A survey
• The diameter of an orientation of a complete multipartite graph
• The minimum diameter of orientations of complete multipartite graphs
• Strongly connected orientations of mixed multigraphs
• Complexity of approximating the oriented diameter of chordal graphs
• Bounds for the minimum oriented diameter
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diameter of orientations of graphs with given minimum degree