Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

DM
2007

favoriteEmaildiscussreport

114views more DM 2007»

An inequality for the group chromatic number of a graph

13 years 5 months ago

An inequality for the group chromatic number of a graph

Download www.math.wvu.edu

—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

Real-time Traffic

Chromatic | DM 2007 | Group Chromatic Number | Structural Theorem |

claim paper

Related Content

» Group chromatic number of planar graphs of girth at least 4

» Strong oriented chromatic number of planar graphs without cycles of specific lengths

» Symplectic graphs and their automorphisms

» Quadratic forms on graphs

» A branchandcut algorithm for partition coloring

» Classifying Textile Designs using Region Graphs

» Orbitcounting polynomials for graphs and codes

» On the Difficulty of Designing Good Classifiers

» Constraint satisfaction a personal perspective

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DM
Authors	Hong-Jian Lai, Xiangwen Li, Gexin Yu

Comments (0)