Title of article
Edge-coloring critical graphs with high degree
Author/Authors
Lianying Miao، نويسنده , , Jian-liang Wu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
4
From page
169
To page
172
Abstract
It is proved here that any edge-coloring critical graph of order n and maximum degree Δ⩾8 has the size at least 3(n+Δ−8). It generalizes a result of Hugh Hind and Yue Zhao.
Keywords
Critical graph , Edge coloring , Edge chromatic number
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949332
Link To Document