Title of article
An inequality for the group chromatic number of a graph
Author/Authors
Hongjian Lai، نويسنده , , Xiangwen Li، نويسنده , , Gexin Yu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
5
From page
3076
To page
3080
Abstract
We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality and discuss applications of the theorem.
Keywords
Group chromatic number , Brooks’ Theorem , Group coloring
Journal title
Discrete Mathematics
Serial Year
2007
Journal title
Discrete Mathematics
Record number
947646
Link To Document