On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle

Let G×H denote the cartesian product of the graphs G and H, and Cn the cycle of order n. We prove the conjecture of Konig et al. that for n⩾2, the minimum diameter of any orientation of the graph C3×C2n+1 is n+3.