The proof of K4-minor free is Class 1.

20 Views Asked by At

I find a result that "if a graph G is K4-minor free with ∆ ≥ 3 then the chromatic index χ′(G) ≤ ∆ (G is belongs to Class 1)", but I cannot find the proof of it. It is about edge coloring. Thank you!