Home > Research > Publications & Outputs > Some upper bounds on the list and total chromat...

Research

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article

Published
<mark>Journal publication date</mark>11/1992
<mark>Journal</mark>Journal of Graph Theory
Issue number5
Volume16
Number of pages14
Pages (from-to)503-516
Publication StatusPublished
<mark>Original language</mark>English

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.