The multiplicity of 1-factors in the square of a graph

Several authors have shown that if G is a connected graph of even order then its square G² has a 1-factor. We show that the square of any connected graph of order 2n has at least n 1-factors and describe all the extremal graphs.