Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T12:31:06.579Z Has data issue: false hasContentIssue false
  • English
  • Français

List Total Colourings of Graphs

Published online by Cambridge University Press:  01 June 1998

M. JUVAN ,
B. MOHAR  and
R. šKREKOVSKI
M. JUVAN
Affiliation:
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)
B. MOHAR
Affiliation:
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)
R. šKREKOVSKI
Affiliation:
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)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 2 , June 1998 , pp. 181 - 188
Copyright
1998 Cambridge University Press