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


List coloring of graphs having cycles of length divisible by a given number
Authors:S. Akbari  M. Ghanbari  M. Jamaali
Affiliation:Department of Mathematical Sciences, Sharif University of Technology, Iran
Abstract:Let G be a graph and χl(G) denote the list chromatic number of G. In this paper we prove that for every graph G for which the length of each cycle is divisible by l (l≥3), χl(G)≤3.
Keywords:List coloring   List chromatic number
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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