New results on chromatic index critical graphs

In this paper, we prove several new results on chromatic index critical graphs. We also prove that if G  is a Δ ( ≥ 4 ) -critical graph, then n Δ ≥ 2 ∑ j = 2 Δ − 1 n j j − 1 + 1 2 n 3 , where n j is the number of vertices having degree j in G .