On a conjecture concerning optimal orientations of the Cartesian product of a triangle and an odd cycle (Q5937458)

Let \(G\times H\) denote the Cartesian product of the graphs \(G\) and \(H\) and let \(C_n\) be the cycle on \(n\) vertices. The authors prove a conjecture of \textit{J.-C. Konig} et al. [Networks 32, 1-11 (1998; Zbl 0990.05041)] that the minimum diameter of any orientation of the graph \(C_3\times C_{2n+1}\) is \(n+3\).