Pair lengths of product graphs (Q2501549)

The pair length of a graph \(G\) is the largest positive integer \(k\), such that the vertex set of \(G\) has a partition into two-element subsets \(\{x,x'\}\) satisfying the following two conditions: \(d(x,x')\geq k\) for every \(x\in V(G)\) and if \(xy\in E(G)\), then \(x'y'\in E(G)\). \textit{Z. Chen} [Discrete Math. 287, 11--15 (2004; Zbl 1050.05026)] asked whether the pair length of the Cartesian product of two graphs is equal to the sum of their pair lengths. The paper gives an affirmative answer.