Minimizing and maximizing the diameter in orientations of graphs

DOI10.1007/BF02986669zbMath0814.05044MaRDI QIDQ1340120

Gregory Gutin

Publication date: 28 May 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

diameterorientation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (18)

Optimal oriented diameter of graphs with diameter 3 ⋮ Addendum to: The diameter of an orientation of a complete multipartite graph [Discrete Math. 149 (1996) 131--139] ⋮ On optimal orientations of complete tripartite graphs ⋮ Optimal orientations of products of paths and cycles ⋮ Oriented diameter of maximal outerplanar graphs ⋮ Large girth and small oriented diameter graphs ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ Multipartite tournaments: a survey ⋮ The orientation number of two complete graphs with linkages ⋮ Lower and upper orientable strong radius and strong diameter of complete \(k\)-partite graphs ⋮ Minimum-cost strong network orientation problems: Classification, complexity, and algorithms ⋮ Directing Road Networks by Listing Strong Orientations ⋮ On a conjecture concerning the orientation number of a graph ⋮ AT-free graphs: Linear bounds for the oriented diameter ⋮ The minimum diameter of orientations of complete multipartite graphs ⋮ On optimal orientation of cycle vertex multiplications ⋮ On optimal orientations of Cartesian products of graphs. I ⋮ Diameter of orientations of graphs with given minimum degree

Cites Work

• Robbins's Theorem for Mixed Multigraphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing and maximizing the diameter in orientations of graphs