(Edge coloring) The edge chromatic number xeCG) of a graph
Chapter 23, Problem 23.8(choose chapter or problem)
(Edge coloring) The edge chromatic number xeCG) of a graph G is the minimLUll number of colors needed for coloring the edges of G so that incident edges get different colors. Clearly, Xe(G) ;;; max d(u), where d(lI) is the degree of vertex u. If G = (5, T; E) is bipartite, the equality sign holds. Prove this for Kn . n .
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer