Edge-colouring of regular graphs of large degree

We consider the following conjecture:Let G be a k-regular simple graph with an even number n of vertices. If k≥n/2then G is k-edge-colourable.We show that this conjecture is true for graphs that are join of two graphs and we provide a polynomial time algorithm for finding a k-edge-colouring of these graphs.