Edge chromatic number question (Graph theory)

Feb 2014
1
0
If G is a regular graph with an uneven number of vertices, prove that X'(G) = ?(G) + 1;
where ?(G) is the maximum degree (in this case any degree) of G and X'(G) is the chromatic index (edge chromatic number).