| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650855 | Discrete Mathematics | 2007 | 5 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hong-Jian Lai, Xiangwen Li, Gexin Yu,