Asymptotics of the total chromatic number for multigraphs
Author: P. Mark Kayll
ABSTRACT
For loopless multigraphs, the total chromatic number is asymptotically
its fractional counterpart as the latter invariant increases without
bound. This extends DIMACS Technical Report 96-20, where the same
assertion, restricted to simple graphs, was proved. The proof for
multigraphs --- presented in this note --- is based on a recent
theorem, due to Kahn, establishing the analogous asymptotic behaviour
of the list-chromatic index.
FOOTNOTE
This note is a companion article to DIMACS Technical Report 96-20.
DIMACS Home Page