The diameter of an orientation of a complete multipartite graph

DOI10.1016/0012-365X(94)00315-AzbMath0846.05038MaRDI QIDQ1910574

B. P. Tan, Khee Meng Koh

Publication date: 25 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

diameterorientationsmultipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Addendum to: The diameter of an orientation of a complete multipartite graph [Discrete Math. 149 (1996) 131--139] ⋮ A size condition for diameter two orientable graphs ⋮ On optimal orientations of complete tripartite graphs ⋮ Optimal orientations of products of paths and cycles ⋮ Bounds for the oriented diameter of planar triangulations ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ A degree condition for diameter two orientability of graphs ⋮ The orientation number of two complete graphs with linkages ⋮ On a conjecture concerning the orientation number of a graph ⋮ A generalization of Sperner's theorem and an application to graph orientations ⋮ 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

• Unnamed Item
• Every vertex a king
• Distances in orientations of graphs
• Kings in multipartite tournaments
• Robbins's Theorem for Mixed Multigraphs

This page was built for publication: The diameter of an orientation of a complete multipartite graph