1. Irregular assignments of trees and forests;Aigner;SIAM J. Discrete Math.,1990
2. Restricted colorings of graphs;Alon,1993
3. P. Erdős, A.L. Rubin, H. Taylor, Choosability in graphs. in: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), in: Congress. Numer., vol. XXVI, pages 125–157, Winnipeg, Man., 1980. Utilitas Math.
4. The list chromatic index of a bipartite multigraph;Galvin;J. Combin. Theory Ser. B,1995
5. Choice number of 3-colorable elementary graphs;Gravier;Discrete Math.,1997