1. R. Diestel, Graph Theory, Graduate Texts in Mathematics, vol. 173, Springer, New York, 2000.
2. Choosability in graphs;Erdös;Congr. Numer.,1980
3. A Hajós-like theorem for list coloring;Gravier;Discrete Math.,1996
4. Über eine Konstruktion nicht n-färbbarer Graphen;Hajós;Wiss. Z. Martin Luther Univ. Math.-Natur. Reihe,1961
5. B. Mohar, Hajós theorem for colorings of edge-weighted graphs, to appear in Combinatorica.