List edge colourings of some 1-factorable multigraphs

The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and any set system {S-e:e is an element of E(G)} with each \S-e\ = k, we can choose elements s(e) is an element of S-e such that s(e) not equal s(f) whenever e and f are adjacent edges. Using a technique of Alon and Tarsi which involves the graph monomial Pi{xu-x(v):uv is an element of E} of an oriented graph, we verify this conjecture for certain families of 1-factcrable multigraphs, including 1-factorable planar graphs.