Welcome to our community

Be a part of something great, join today!

Class 1 vs class 2 of graphs

abdolah

New member
Jan 26, 2014
2
Vizing's theorem states that a graph can be edge-colored in either Δ or Δ+1 colors, where Δ is the maximum degree of the graph.

A graph with edge chromatic number equal to Δ is known as a class 1 graph.

A graph with edge chromatic number equal to Δ+1 is known as a class 2 graph.

which one of them are bigger?(contains more graphs) and why?