Optimal orientations of graphs and digraphs: A survey
From MaRDI portal
Publication:1865627
DOI10.1007/S003730200060zbMATH Open1009.05063OpenAlexW1986862973MaRDI QIDQ1865627FDOQ1865627
Publication date: 27 March 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200060
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Extremal set theory (05D05)
Cited In (27)
- On optimal orientations of complete tripartite graphs
- Oriented diameter of maximal outerplanar graphs
- A degree condition for diameter two orientability of graphs
- The complexity of two graph orientation problems
- Series-parallel orientations preserving the cycle-radius
- A generalization of Sperner's theorem and an application to graph orientations
- On optimal orientations of Cartesian products of graphs. I
- The oriented diameter of graphs with given connected domination number and distance domination number
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
- Diameter three orientability of bipartite graphs
- On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
- Optimal oriented diameter of graphs with diameter 3
- Title not available (Why is that?)
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Optimal orientations of vertex-multiplications of cartesian products of graphs
- Oriented diameter of graphs with given girth and maximum degree
- Improved bound on the oriented diameter of graphs with given minimum degree
- Title not available (Why is that?)
- Large girth and small oriented diameter graphs
- A size condition for diameter two orientable graphs
- Optimal level placement of the transitive oriented and bipartite oriented graphs by height
- On the oriented diameter of planar triangulations
- Directing Road Networks by Listing Strong Orientations
- Bounds for the oriented diameter of planar triangulations
- On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
- On reorienting graphs by pushing down maximal vertices. II
- Diameter of orientations of graphs with given minimum degree
Recommendations
This page was built for publication: Optimal orientations of graphs and digraphs: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865627)