Chetwynd, Amanda G. and Hilton, A. J. W. and Zhao, Cheng (1991) On the total chromatic number of graphs of high minimum degree. Journal of the London Mathematical Society, Series (2). pp. 193-202.
Full text not available from this repository.Official URL: http://dx.doi.org/10.1112/jlms/s2-44.2.193
Abstract
If G is a simple graph with minimum degree (G) satisfying (G) f(|V(G|+1) the total chromatic number conjecture holds; moreover if (G) |V(G| then T(G) (G)+3. Also if G has odd order and is regular with d{G) 7|(G)| then a necessary and sufficient condition for T(G) = (G)+1 is given.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Journal of the London Mathematical Society |
| Subjects: | Q Science > QA Mathematics |
| Departments: | Faculty of Science and Technology > Mathematics and Statistics VC's Office |
| ID Code: | 20037 |
| Deposited By: | Prof Amanda Chetwynd |
| Deposited On: | 25 Nov 2008 14:15 |
| Refereed?: | No |
| Published?: | Published |
| Last Modified: | 26 Jul 2012 15:37 |
| Identification Number: | |
| URI: | http://eprints.lancs.ac.uk/id/eprint/20037 |
Actions (login required)
| View Item |
