首页 | 本学科首页   官方微博 | 高级检索  
     


An inequality for the group chromatic number of a graph
Authors:Hong-Jian Lai  Gexin Yu
Affiliation:a Department of Mathematics, West Virginia University, Morgantown, WV 26505, USA
b Department of Mathematics, Huazhong Normal University, Wuhan 430079, China
c Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA
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:Brooks&rsquo   Theorem   Group coloring   Group chromatic number
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号