Chetwynd, Amanda G. and Haggkvist, Roland A. (1996) *An improvement of Hind's upper bound on the total chromatic number.* Combinatorics, Probability and Computing, 5 (2). pp. 99-104. ISSN 0963-5483

Official URL: http://dx.doi.org/10.1017/S0963548300001899

## Abstract

We show that the total chromatic number of a simple k-chromatic graph exceeds the chromatic index by at most 18k ⅓ log ½ 3k.

Item Type: | Article |
---|---|

Journal or Publication Title: | Combinatorics, Probability and Computing |

Subjects: | Q Science > QA Mathematics |

Departments: | Faculty of Science and Technology > Mathematics and Statistics VC's Office |

ID Code: | 20770 |

Deposited By: | Prof Amanda Chetwynd |

Deposited On: | 26 Nov 2008 12:16 |

Refereed?: | No |

Published?: | Published |

Last Modified: | 07 Jan 2015 13:19 |

Identification Number: | |

URI: | http://eprints.lancs.ac.uk/id/eprint/20770 |

### Actions (login required)

View Item |