1. Erdōs, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), pp. 125–157, Congress. Numer., XXVI, Utilitas Math., Winnipeg, Man., 1980
2. Giaro, K., Kubale, M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Inf. Proc. Letters, 75, 65–69 (2000)
3. Isaak, G.: Sum list coloring 2× n arrays. Elec. J. Combinatorics 9, #N8 (2002)
4. Isaak, G.: Sum list coloring block graphs. Graphs and Combinatorics 20, 499–506 (2004)
5. Woodall, D.R.: List colourings of graphs. Surveys in Combinatorics. J.W.P. Hirschfeld ed., London Math Soc. Lec. Notes Ser. 288, Cambridge Univ. Press, Cambridge, 2001, pp. 269–301