On optimal orientations of Cartesian products of even cycles and paths

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199708)30:1<1::AID-NET1>3.0.CO;2-H" /><1::AID-NET1>3.0.CO;2-H 10.1002/(SICI)1097-0037(199708)30:1<1::AID-NET1>3.0.CO;2-HzbMath0881.05041OpenAlexW1988507086MaRDI QIDQ4355479

Khee Meng Koh, Eng Guan Tay

Publication date: 11 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199708)30:1<1::aid-net1>3.0.co;2-h

zbMATH Keywords

pathscyclesdistancediameterCartesian productsstrong orientations

Mathematics Subject Classification ID

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

Related Items (10)

Optimal orientations of vertex-multiplications of cartesian products of graphs ⋮ Optimal orientations of products of paths and cycles ⋮ The diameter of strong orientations of Cartesian products of graphs ⋮ 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 ⋮ Minimum-cost strong network orientation problems: Classification, complexity, and algorithms ⋮ On a conjecture concerning the orientation number of a graph ⋮ On optimal orientations of Cartesian products of graphs. I

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