Optimal orientations of graphs and digraphs: A survey
From MaRDI portal
Publication:1865627
DOI10.1007/s003730200060zbMath1009.05063OpenAlexW1986862973MaRDI QIDQ1865627
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
Extremal problems in graph theory (05C35) Extremal set theory (05D05) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (21)
Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Optimal oriented diameter of graphs with diameter 3 ⋮ Improved bound on the oriented diameter of graphs with given minimum degree ⋮ Optimal orientations of vertex-multiplications of cartesian products of graphs ⋮ A size condition for diameter two orientable graphs ⋮ On optimal orientations of complete tripartite graphs ⋮ Oriented diameter of maximal outerplanar graphs ⋮ Bounds for the oriented diameter of planar triangulations ⋮ The complexity of two graph orientation problems ⋮ Series-parallel orientations preserving the cycle-radius ⋮ Oriented diameter of graphs with given girth and maximum degree ⋮ The oriented diameter of graphs with given connected domination number and distance domination number ⋮ Large girth and small oriented diameter graphs ⋮ Unnamed Item ⋮ Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs ⋮ A degree condition for diameter two orientability of graphs ⋮ Diameter three orientability of bipartite graphs ⋮ Directing Road Networks by Listing Strong Orientations ⋮ A generalization of Sperner's theorem and an application to graph orientations ⋮ Unnamed Item ⋮ Diameter of orientations of graphs with given minimum degree
This page was built for publication: Optimal orientations of graphs and digraphs: A survey