Optimal orientations of products of paths and cycles

DOI10.1016/S0166-218X(97)00017-6zbMath0886.05060OpenAlexW2029307530MaRDI QIDQ1377664

Eng Guan Tay, Khee Meng Koh

Publication date: 10 May 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

distancediameterdirected graphsstrong orientation

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (10)

Optimal orientations of vertex-multiplications of cartesian products of graphs ⋮ The diameter of strong orientations of Cartesian products of graphs ⋮ The optimal strong radius and optimal strong diameter of the Cartesian product graphs ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ The diameter of strong orientations of strong products of graphs ⋮ Oriented diameter of graphs with diameter 3 ⋮ The orientation number of two complete graphs with linkages ⋮ Optimal orientations of strong products of paths ⋮ On a conjecture concerning the orientation number of a graph ⋮ On optimal orientations of Cartesian products of graphs. I

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orientations of the n-cube with minimum diameter
• Every vertex a king
• Distances in orientations of graphs
• On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
• Minimizing and maximizing the diameter in orientations of graphs
• On optimal orientations of Cartesian products of graphs. I
• The diameter of an orientation of a complete multipartite graph
• On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles
• The minimum diameter of orientations of complete multipartite graphs
• On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
• On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
• Robbins's Theorem for Mixed Multigraphs
• On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
• On optimal orientations of Cartesian products of even cycles and paths
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: Optimal orientations of products of paths and cycles