Decomposition of class II graphs into two class I graphs

Yan Cao, Guangming Jing, Rong Luo +3

Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum $\Delta$-edge-colorable subgraph and a matching.…