Generalized list T-colorings of cycles

Authors:
Jirí Fiala;Riste Škrekovski
Affiliations:
Charles University, Faculty of Mathematics and Physics, DIMATIA, 118 00 Prague, Czech Republic and Institute for Theoretical Computer Science (ITI), Malostranské nám. 2/25, Prague, Czech ...;Charles Univ., Fac. of Math. and Phys. and Inst. for Theor. Comp. Sci. (ITI), Prague, Czech Rep. and Dept. of Math., Univ. of Ljubljana, Ljubljana, Slovenia and Pacific Inst. for Math. Sci. (PIMS) ...
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 4
Cited 0

Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition

SIAM Journal on Discrete Mathematics
T-choosability in graphs

Discrete Applied Mathematics
Graph labeling and radio channel assignment

Journal of Graph Theory

Quantified Score

Hi-index	0.04

Visualization

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.