Let H be a nonempty regular graph of degree r and odd order, and let G be a graph obtained from H by deleting (r-1)/2 or fewer edges. Show that G is of class two i.e. edge chromatic number of G is 1+max(degv_i) for every i.
Follow Math Help Forum on Facebook and Google+
View Tag Cloud