Diameter three orientability of bipartite graphs

DOI10.37236/9723zbMath1465.05030OpenAlexW3163988689MaRDI QIDQ2030744

Bin Chen, An Chang

Publication date: 7 June 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/9723

zbMATH Keywords

distancediameterorientationminimum degreeoriented diameter

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Related Items (2)

The oriented diameter of graphs with given connected domination number and distance domination number ⋮ Large girth and small oriented diameter graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bound on the oriented diameter of graphs with given minimum degree
• Oriented diameter of graphs with diameter 3
• Distances in orientations of graphs
• A degree condition for diameter two orientability of graphs
• 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
• A size condition for diameter two orientable graphs
• A Remark on Stirling's Formula
• Robbins's Theorem for Mixed Multigraphs
• Diametrically critical tournaments
• 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: Diameter three orientability of bipartite graphs