On optimal orientations of Cartesian products of even cycles

DOI<299::AID-NET6>3.0.CO;2-X 10.1002/(SICI)1097-0037(199812)32:4<299::AID-NET6>3.0.CO;2-XzbMath0990.05062OpenAlexW2045054614MaRDI QIDQ4540084

Khee Meng Koh, Eng Guan Tay

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199812)32:4<299::aid-net6>3.0.co;2-x

zbMATH Keywords

pathscycledigraphdiameterCartesian productorientations

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

The optimal strong radius and optimal strong diameter of the Cartesian product graphs ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ The orientation number of two complete graphs with linkages ⋮ On a conjecture concerning the orientation number of a graph ⋮ AT-free graphs: Linear bounds for the oriented diameter ⋮ On optimal orientations of Cartesian products of graphs. I

This page was built for publication: On optimal orientations of Cartesian products of even cycles