Bounds for the minimum oriented diameter
From MaRDI portal
Abstract: We consider the problem of finding an orientation with minimum diameter of a connected bridgeless graph. Fomin et. al. discovered a relation between the minimum oriented diameter an the size of a minimal dominating set. We improve their upper bound.
Recommendations
Cited in
(19)- A degree condition for diameter two orientability of graphs
- Oriented diameter of maximal outerplanar graphs
- Bilateral orientations and domination
- The oriented diameter of graphs with given connected domination number and distance domination number
- Diameter three orientability of bipartite graphs
- Bounds for the minimal oriented diameter
- Optimal oriented diameter of graphs with diameter 3
- On a relation between the domination number and a strongly connected bidirection of an undirected graph
- Oriented diameter of graphs with given girth and maximum degree
- Improved bound on the oriented diameter of graphs with given minimum degree
- Minimum diameter and tF(f, q)
- Large girth and small oriented diameter graphs
- scientific article; zbMATH DE number 5307866 (Why is no real title available?)
- On the oriented diameter of planar triangulations
- Directing Road Networks by Listing Strong Orientations
- The oriented diameter of a bridgeless graph with given \(P_3\)
- Bounds for the oriented diameter of planar triangulations
- AT-free graphs: Linear bounds for the oriented diameter
- Diameter of orientations of graphs with given minimum degree
This page was built for publication: Bounds for the minimum oriented diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403018)
