Sciweavers

Share
DM
2007

An inequality for the group chromatic number of a graph

8 years 3 months ago
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.
Hong-Jian Lai, Xiangwen Li, Gexin Yu
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where DM
Authors Hong-Jian Lai, Xiangwen Li, Gexin Yu
Comments (0)
books