Edge-colouring of join graphs

A join graph is the complete union of two arbitrary graphs. We give sufficient conditions for a join graph to be 1-factorizable. As a consequence of our results, the Hilton’s Overfull Subgraph Conjecture holds true for several subclasses of join graphs.