1. A new upper bound for the list chromatic number;Bollobás;Discrete Math.,1989
2. An extension of Kotzig theorem and the list edge colouring of plane graphs (in Russian);Borodin;Matem. Zametki,1990
3. Some upper bounds on the total and list chromatic numbers of multigraphs;Chetwind,1990
4. Choosability in graphs;Erdős;Congr. Numer.,1979
5. H. Hind, Restricted edge-colourings, Doct. Thesis, Peterhouse College, Cambridge.