Title of article
New results on chromatic index critical graphs
Author/Authors
Zhang، نويسنده , , Limin and Shi، نويسنده , , Wenjun and Huang، نويسنده , , Xianzhen and Li، نويسنده , , Guangrong، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
3733
To page
3737
Abstract
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 .
Keywords
Edge-coloring , Chromatic index , Critical graph
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598869
Link To Document