Loading...

An algebraic criterion for the choosability of graphs

Akbari, S ; Sharif University of Technology

275 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s00373-014-1411-7
  3. Abstract:
  4. Let (Formula presented.) be a graph of order (Formula presented.) and size (Formula presented.). Suppose that (Formula presented.) is a function such that (Formula presented.). In this paper we provide a criterion for (Formula presented.)-choosability of (Formula presented.). Using this criterion, it is shown that the choice number of the complete (Formula presented.)-partite graph (Formula presented.) is (Formula presented.), which is a well-known result due to Erdös, Rubin and Taylor. Among other results we study the (Formula presented.)-choosability of the complete (Formula presented.)-partite graphs with part sizes at most (Formula presented.), when (Formula presented.), for every vertex (Formula presented.)
  5. Keywords:
  6. Choosability ; List coloring
  7. Source: Graphs and Combinatorics ; Volume 31, Issue 3 , 2014 , pp. 497-506 ; ISSN: 14355914
  8. URL: http://link.springer.com./article/10.1007%2Fs00373-014-1411-7