Title of article
The chromatic index of graphs of high maximum degree Original Research Article
Author/Authors
Irene K.H. Chew، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
15
From page
77
To page
91
Abstract
In this paper, we give sufficient conditions for simple graphs to be class 1. These conditions mainly depend on the edge-connectivity, maximum degree and the number of vertices of maximum degree of a graph. Using these conditions, we can extend various results of Chetwynd and Hilton, and Niessen and Volkmann.
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
944059
Link To Document