Hostname: page-component-7dd5485656-s6l46 Total loading time: 0 Render date: 2025-10-31T17:48:17.797Z 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)
Get access Rights & Permissions [Opens in a new window]

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.

Information

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable