Factorizations of regular graphs (Q922555)

Let G be a k-regular graph of order 2n such that \(k\geq n\). \textit{A. J. W. Hilton} [J. Graph Theory 9, 193-196 (1985; Zbl 0624.05050)] proved that G contains at least \(\lfloor k/3\rfloor\) edge-disjoint 1-factors. Hilton's theorem is improved in this paper that G contains at least \(\lfloor k/2\rfloor\) edge-disjoint 1-factors. The following result is also proved in this paper. Let G be a 2-connected, k-regular, non-bipartite graph of order at most 3k-3 and x, y be a pair of distinct vertices. If \(G\setminus \{x,y\}\) is connected, then g contains an (x,y)-Hamilton path.