Some upper bounds on the total and list chromatic numbers of multigraphs

Abstract

Abstract In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an n ‐order multigraph exceeds the chromatic index by the smallest t such that t ! > n .