The edge chromatic number Χ e (G) of a graph G is the minimum number of colors needed for coloring the edges of G so that incident edges get different colors. Clearly, Χ e (G) ≥ max d(u), where d(u) is the degree of vertex u. If G = (S, T; E) is bipartite, the equality sign holds. Prove this

Chapter 23, PROBLEM SET 23.8 #26

This problem has been solved!


Do you need an answer to a question different from the above? Ask your question!

The edge chromatic number Χe(G) of a graph G is the minimum number of colors needed for coloring the edges of G so that incident edges get different colors. Clearly, Χe(G) ≥ max d(u), where d(u) is the degree of vertex u. If G = (S, T; E) is bipartite, the equality sign holds. Prove this for Kn,n the complete bipartite graph G = (S, T, E) with S and T consisting of n vertices each.

Related Book For answer-question

Advanced Engineering Mathematics

10th edition

Authors: Erwin Kreyszig

ISBN: 978-0470458365