Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10328294 | Discrete Applied Mathematics | 2005 | 13 Pages |
Abstract
In this paper, we show that the Alon-Tarsi theorem for choosability in graphs has an analogous version for the generalized list T-colorings-a concept which captures both the channel assignment problem and the T-colorings. We apply this result to cycles for generalized list labelings with a condition at distance two.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
JiÅÃ Fiala, Riste Å krekovski,