Improved bound on the oriented diameter of graphs with given minimum degree
From MaRDI portal
(Redirected from Publication:326665)
Recommendations
Cites work
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- AT-free graphs: Linear bounds for the oriented diameter
- Bounds for the minimum oriented diameter
- Complexity of approximating the oriented diameter of chordal graphs
- Diameter of orientations of graphs with given minimum degree
- Distances in orientations of graphs
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- Optimal orientations of graphs and digraphs: A survey
- Orientation of 2-edge-connected graphs with diameter 3
- Oriented diameter of graphs with diameter 3
- Radius, diameter, and minimum degree
- Strongly connected orientations of mixed multigraphs
Cited in
(29)- A degree condition for diameter two orientability of graphs
- Diameter three orientability of bipartite graphs
- 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
- 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
- The minimum diameter of orientations of complete multipartite graphs
- A size condition for diameter two orientable graphs
- Oriented diameter of graphs with given girth and maximum degree
- Bounds for the minimal oriented diameter
- scientific article; zbMATH DE number 6672459 (Why is no real title available?)
- scientific article; zbMATH DE number 6837061 (Why is no real title available?)
- Oriented diameter of graphs with given maximum degree
- An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter
- Bounds for the minimum oriented diameter
- Improved bounds for the oriented radius of mixed multigraphs
- Oriented diameter of maximal outerplanar graphs
- The oriented diameter of graphs with given connected domination number and distance domination number
- The oriented diameter of a bridgeless graph with given \(P_3\)
- Large girth and small oriented diameter graphs
- Diameter two orientability of mixed graphs
- Using the minimum and maximum degrees to bound the diameter of orientations of bridgeless graphs
- Diameter three orientability of mixed bipartite graphs
- Diameter of orientations of graphs with given order and number of blocks
- The oriented diameter of a bridgeless graph with the given path P_k
- The oriented diameter of graphs derived from other graphs
- On the oriented diameter of near planar triangulations
- The oriented diameter of mixed multigraphs with diameter 2
- Lower and upper orientable strong diameters of graphs satisfying the Ore condition
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)
