Combinatorics, Probability and Computing

Table of Contents - 1998 - Volume 7, Issue 02  


List Total Colourings of Graphs

M. JUVAN a1 1 , B. MOHAR a1 1 and R. ŠKREKOVSKI a1 1
a1 Department of Mathematics, University of Ljubljana, Jadranska 19, 1111 Ljubljana, Slovenia (e-mail: martin.juvan@fmf.uni-lj.si, bojan.mohar@uni-lj.si, riste.skrekovski@fmf.uni-lj.si)

Abstract

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)


Footnotes

1 Supported in part by the Ministry of Science and Technology of Slovenia, Research Project J1-7036.