Optimal orientations of graphs and digraphs: A survey

DOI10.1007/S003730200060zbMATH Open1009.05063OpenAlexW1986862973MaRDI QIDQ1865627FDOQ1865627

Authors E. G. Tay, K. M. Koh

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

zbMATH Keywords

diametereccentricity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Extremal set theory (05D05)

Recommendations

• Optimal orientations of subgraphs of complete bipartite graphs
• scientific article; zbMATH DE number 5976594
• Optimal orientations of some line graphs
• Optimal orientations of \(P_3\times K_5\) and \(C_8\times K_3\).
• Optimal orientations of some complete tripartite graphs

Cited in

(29)

• Diameter of orientations of graphs with given minimum degree
• On reorienting graphs by pushing down maximal vertices. II
• Oriented diameter of graphs with given girth and maximum degree
• scientific article; zbMATH DE number 4112622 (Why is no real title available?)
• The oriented diameter of a bridgeless graph with given \(P_3\)
• Optimal level placement of the transitive oriented and bipartite oriented graphs by height
• Optimal orientations of subgraphs of complete bipartite graphs
• Oriented diameter of maximal outerplanar graphs
• Series-parallel orientations preserving the cycle-radius
• On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
• On the oriented diameter of planar triangulations
• Optimal orientations of vertex-multiplications of Cartesian products of graphs
• A degree condition for diameter two orientability of graphs
• The complexity of two graph orientation problems
• Optimal orientations of some line graphs
• On optimal orientations of Cartesian products of graphs. I
• Directing Road Networks by Listing Strong Orientations
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• Bounds for the oriented diameter of planar triangulations
• A size condition for diameter two orientable graphs
• Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
• Large girth and small oriented diameter graphs
• A generalization of Sperner's theorem and an application to graph orientations
• On optimal orientations of complete tripartite graphs
• Augmenting weighted graphs to establish directed point-to-point connectivity
• Improved bound on the oriented diameter of graphs with given minimum degree
• Optimal oriented diameter of graphs with diameter 3
• The oriented diameter of graphs with given connected domination number and distance domination number
• Diameter three orientability of bipartite graphs

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)