List Total Colourings of Graphs
We study the concept of list total colourings and prove that every multigraph of maximum degree 3 is 5-total-choosable. We also show that the total choice number of a graph of maximum degree 2 is equal to its total chromatic number.(Received November 5 1996)
(Revised January 16 1997)
1 Supported in part by the Ministry of Science and Technology of Slovenia, Research Project J1-7036.