An inequality for the group chromatic number of a graph

—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— Brooks’ Theorem, Group coloring, Group chromatic number.

• Type: Journal
• Year: 2007
• Where: DM
• Authors: Hong-Jian Lai, Xiangwen Li, Gexin Yu
• Keywords: Chromatic, DM 2007, Group Chromatic Number, Structural Theorem