List coloring of graphs having cycles of length divisible by a given number

被引：4

作者：

Akbari, S. ^{[1
]}

Ghanbari, M. ^{[1
]}

Jahanbekam, S. ^{[1
]}

Jamaali, M. ^{[1
]}

机构：

[1] Sharif Univ Technol, Dept Math Sci, Tehran, Iran

来源：

DISCRETE MATHEMATICS | 2009年 / 309卷 / 03期

关键词：

List coloring; List chromatic number;

D O I：

10.1016/j.disc.2008.08.017

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a graph and chi(l)(G) denote the list chromatic number of G. In this paper we prove that for every graph C for which the length of each cycle is divisible by l (l >= 3), chi(l)(G) <= 3. (c) 2008 Elsevier B.V. All rights reserved.

引用

页码：613 / 614

页数：2