Oriented diameter of graphs with given girth and maximum degree

DOI10.1016/j.disc.2022.113287OpenAlexW4311254114MaRDI QIDQ2685322

An Chang, Bin Chen

Publication date: 21 February 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113287

zbMATH Keywords

bridgeless graphgirthmaximum degreeoriented diameter

Mathematics Subject Classification ID

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

Cites Work

• Improved bound on the oriented diameter of graphs with given minimum degree
• Oriented diameter of graphs with diameter 3
• Distances in orientations of graphs
• AT-free graphs: Linear bounds for the oriented diameter
• Optimal orientations of graphs and digraphs: A survey
• Optimal oriented diameter of graphs with diameter 3
• An improvement to Chvátal and Thomassen's upper bound for oriented diameter
• Diameter of orientations of graphs with given minimum degree
• Oriented diameter of graphs with given maximum degree
• Bounds for the minimum oriented diameter
• Digraphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: Oriented diameter of graphs with given girth and maximum degree