1. Progress on the Hall-number-two problem;Eslahchi;Australasian J. Combin.,2000
2. Characterization of graphs with Hall number 2;Eslahchi;J. Graph Theory,2004
3. Erdős, P., A.L. Rubin, and H. Taylor, Choosability in graphs, Proc. West-Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, California, Congr. Numer. XXVI (1979), 125–157
4. The list chromatic index of a bipartite multigraph;Galvin;J. Combin. Theory B,1995
5. Gröflin, H., Feasible graph coloring and a generalization of perfect graphs, manuscript, University of Fribourg, 1992