Section 1.9: List Coloring
The paper
F. Galvin, The List Chromatic Index of a Bipartite Multigraph,
J. Combin. Theory Ser. B 63 (1995), 153-158
contains the advertised proof of the Dinitz conjecture.
A self-contained proof can be found in
T. Slivnik, Short Proof of Galvin's Theorem on the List-chromatic Index of
a Bipartite Multigraph, Combin. Probab. Comput. 5 (1996) 91-94.
August, 1997 Tommy R. Jensen
Last modified August 13, 1997 Tommy R. Jensen