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


A Note on Group Choosability of Graphs with Girth at least 4
Authors:G R Omidi
Institution:1. Department of Mathematical Sciences, Isfahan University of Technology, 84156-83111, Isfahan, Iran
2. School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran
Abstract:In this paper we show that the group choice number of a graph without K 5-minor or K 3,3-minor with girth at least 4 (resp. 6) is at most 4 (resp. 3) and we conclude that these results hold for the group chromatic number, the choice number and the chromatic number.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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