Loading...

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

Akbari, S ; Sharif University of Technology | 2009

220 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.disc.2008.08.017
  3. Publisher: 2009
  4. Abstract:
  5. 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. © 2008 Elsevier B.V. All rights reserved
  6. Keywords:
  7. List chromatic number ; List coloring ; List chromatic number ; List coloring ; Coloring
  8. Source: Discrete Mathematics ; Volume 309, Issue 3 , 2009 , Pages 613-614 ; 0012365X (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0012365X08005244