Improved bound on the oriented diameter of graphs with given minimum degree
From MaRDI portal
Publication:326665
DOI10.1016/J.EJC.2016.08.006zbMATH Open1348.05068OpenAlexW2509587582MaRDI QIDQ326665FDOQ326665
Authors: 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
Recommendations
Cites Work
- Strongly connected orientations of mixed multigraphs
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- Radius, diameter, and minimum degree
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- Distances in orientations 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
- Complexity of approximating the oriented diameter of chordal graphs
- Bounds for the minimum oriented diameter
- Orientation of 2-edge-connected graphs with diameter 3
- Oriented diameter of graphs with diameter 3
Cited In (16)
- Title not available (Why is that?)
- Oriented diameter of maximal outerplanar graphs
- A degree condition for diameter two orientability of graphs
- An improvement to Chvátal and Thomassen's upper bound for oriented diameter
- Improved bounds for the oriented radius of mixed multigraphs
- The oriented diameter of graphs with given connected domination number and distance domination number
- Diameter three orientability of bipartite graphs
- A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture
- Optimal oriented diameter of graphs with diameter 3
- Oriented diameter of graphs with given girth and maximum degree
- Large girth and small oriented diameter graphs
- A size condition for diameter two orientable graphs
- The minimum diameter of orientations of complete multipartite graphs
- Lower and upper orientable strong diameters of graphs satisfying the Ore condition
- An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
- Title not available (Why is that?)
This page was built for publication: Improved bound on the oriented diameter of graphs with given minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326665)
