Title of article
List coloring of graphs having cycles of length divisible by a given number
Author/Authors
Akbari، نويسنده , , S. and Ghanbari، نويسنده , , M. and Jahanbekam، نويسنده , , S. and Jamaali، نويسنده , , M.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
2
From page
613
To page
614
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
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598522
Link To Document