On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles

DOI10.1016/S0012-365X(99)00136-3zbMath0945.05018OpenAlexW2021358822MaRDI QIDQ1969779

Eng Guan Tay, Khee Meng Koh

Publication date: 8 October 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00136-3

zbMATH Keywords

diameterCartesian productseven cyclesorientation

Mathematics Subject Classification ID

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

Related Items (9)

Optimal orientations of products of paths and cycles ⋮ The diameter of strong orientations of Cartesian products of graphs ⋮ Bounds for the oriented diameter of planar triangulations ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ The diameter of strong orientations of strong products of graphs ⋮ 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 ⋮ AT-free graphs: Linear bounds for the oriented diameter

This page was built for publication: On optimal orientations of Cartesian products of graphs. II: Complete graphs and even cycles