Large girth and small oriented diameter graphs
From MaRDI portal
Publication:6197710
DOI10.1016/j.disc.2023.113846arXiv2201.07618OpenAlexW4390038794MaRDI QIDQ6197710
Publication date: 19 February 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.07618
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bound on the oriented diameter of graphs with given minimum degree
- 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
- A degree condition for diameter two orientability of graphs
- 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
- Diameter three orientability of bipartite graphs
- An improvement to Chvátal and Thomassen's upper bound for oriented diameter
- Diameter of orientations of graphs with given minimum degree
- A size condition for diameter two orientable graphs
- Strongly connected orientations of mixed multigraphs
- Complexity of approximating the oriented diameter of chordal graphs
- Oriented diameter of graphs with given maximum degree
- Bounds for the minimum oriented diameter
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Oriented diameter of star graphs
- Oriented diameter of maximal outerplanar graphs
This page was built for publication: Large girth and small oriented diameter graphs