Generalized list T-colorings of cycles Original Research Article

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.