| Abstract: | A multicircuit is a multigraph whose underlying simple graph is a circuit (a connected 2‐regular graph). In this pair of papers, it is proved that every multicircuit C has total choosability (i.e., list total chromatic number) ch′′(C) equal to its ordinary total chromatic number χ′′(C). In the present paper, the kernel method is used to prove this for every multicircuit that has at least two vertices with degree less than its maximum degree Δ. The result is also proved for every multicircuit C for which χ′′(C)≥Δ+2. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 26–43, 2002 |
