A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths (Q1348660)

An orthogonal double cover (ODC) of the complete graph of order \(n\) may be viewed as a partition of the edge set of \(2K_n\) into spanning subgraphs, called factors, such that every two factors have (two different copies of) an edge in common. If all factors are isomorphic to some graph \(G\), then we say that we have \(G\)-factors and an ODC of \(K_n\) by \(G\). An ODC is said to be 2-colorable if the underlying \(K_n\) has an edge-coloring using two colors such that the edges of each factor are alternately colored. ODCs that are 2-colorable are needed in a recursive construction of \textit{J. D. Horton} and \textit{G. M. Nonay} [Discrete Math. 97, No. 1-3, 251-264 (1991; Zbl 0780.05035)]. In the current paper, 2-colorable ODCs of \(K_n\) and \(K_{2n}\) by Hamiltonian paths are constructed for all odd square numbers \(n \geq 9\).