Lancaster EPrints

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

Haggkvist, Roland A. and Chetwynd, Amanda G. (1992) Some upper bounds on the list and total chromatic numbers of multigraphs. Journal of Graph Theory, 16 (5). pp. 503-516. ISSN 0364-9024

Full text not available from this repository.

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.

Item Type: Article
Journal or Publication Title: Journal of Graph Theory
Subjects: Q Science > QA Mathematics
Departments: Faculty of Science and Technology > Mathematics and Statistics
VC's Office
ID Code: 20055
Deposited By: Prof Amanda Chetwynd
Deposited On: 25 Nov 2008 11:57
Refereed?: No
Published?: Published
Last Modified: 26 Jul 2012 15:37
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/20055

Actions (login required)

View Item