An improvement of hind's upper bound on the total chromatic number

Combinatorics Probability and Computing

Volumn 5, Issue 2, 1996, Pages 99-104

  Chetwynd, Amanda ^a   Häggkvist, Roland ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b UMEÅ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030549659     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300001899     Document Type: Article

References (9)

1. Chernoff, H. (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals Math. Statist. 23 493-509.
2. Chetwynd, A. G. and Häggkvist, R. (1992) Some upper bounds on the total and list chromatic numbers of multigraphs. J. Graph Theory 16(5) 503-516.
3. Erdös, P. and Lovász, L. (1973) Problems and results on 3-chromatic hypergraphs and some related questions. In Colloquia Mathematica Societatis János Bolyai 10. Infinite and finite sets, Keszthely, Hungary (A. Hajnal, R. Rado and V. T. Sós, eds.). North-Holland, 609-627.
4. Häggkvist, R. and Thomason, A. G. (1993) Oriented hamilton cycles in digraphs. Research report no. 1, Department of Mathematics, University of Umeå, Sweden.
5. Hind, H. (1988) Restricted edge-colourings. Doctoral Thesis, Peterhouse College, Cambridge, UK.
6. Hind, H. (1990) An upper bound for the total chromatic number. Graphs and Combinatorics 6 153-160.
7. Lovász, L. (1979) Combinatorial Problems and Exercises. North-Holland.
8. Spencer, J. (1987) Ten Lectures on the Probabilistic Method. SIAM, Philadelphia, PA.
9. Vizing, V. G. (1964) On an estimate of the chromatic class of a p-graph. Diskret Analiz. 3 25-30 (in Russian).