GraphG is n-connected, regular with degree n, and has and even number of vertices. Prove that G has a one-factor.
I see that you have some other postings, more than 170.
You should understand by now that this is not a homework service nor is it a tutorial service. Please either post some of your own work on this problem or explain what you do not understand about the question.