List version of L(d,s)-labelings

We prove a general bound for χℓd,s(G) depending on the maximum degree of G. Furthermore, we study this parameter for trees, and also for the particular classes of paths and stars. Polynomial algorithms are designed for deciding whether a given list assignment admits an L(d,s)-list labeling on paths (for a given s unrestricted) and on trees (for s=1).