New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs

Combinatorics Probability and Computing

Volumn 6, Issue 3, 1997, Pages 295-313

  Häggkvist, Roland ^a   Janssen, Jeannette ^b  

^a UMEÅ UNIVERSITY   (Sweden)

^b LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041097933     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397002927     Document Type: Article

References (27)

1. Alon, N. (1993) Restricted colorings of graphs. In: Surveys in Combinatorics, Proc. 14th British Combinatorial Conference: LMS Lecture Note Series 187, Cambridge 1-33.
2. Alon, N. and Tarsi, M. (1992) Colorings and orientations of Graphs. Combinatorica 12 125-134.
3. Bollobás, B. and Harris, A. J. (1985) List colourings of graphs. Graphs and Combinatorics 1 115-127.
4. Bollobás, B. and Hind, H. (1989) A new upper bound for the list chromatic number. Discrete Mathematics 74 65-75.
5. Chetwynd, A. G. and Häggkvist, R. (1992) Some upper bounds on the total and list chromatic numbers of multigraphs. J. Graph Theory 16 503-516.
6. Chetwynd, A. G. and Häggkvist, R. (1989) A note on list colourings. J. Graph Theory 13 87-95.
7. Chetwynd, A. G. and Häggkvist, R. (1996) An improvement of Hind's upper bound on the total chromatic number. Combinatorics, Probability & Computing 5 99-104.
8. Ellingham, M. N. and Goddyn, L. (1996) List edge colourings of some I-factorable multigraphs. Combinatorica 16 343-352.
9. Erdos, P., Rubin, A. and Taylor, H. (1980) Choosability in graphs. In: Proc. West Coast Conference on Combinatorics (Arcata: Humboldt State University 1979). Congressus Numerantium 26 125-157.
10. Galvin, F. (1995) The List Chromatic Index of a Bipartite Multigraph. J. Combin. Th. B 63 (1) 153-158.
11. Häggkvist, R. (1989) Towards a solution of the Dinitz problem? Discrete Math. 75 247-251. (Also in Annals of Discrete Mathematics 43, B. Bollobás, ed.)
12. Häggkvist, R. (1989) Towards a solution of the Dinitz problem? Discrete Math. 75 247-251. (Also in Annals of Discrete Mathematics 43, B. Bollobás, ed.)
13. Hind, H. R. F. (1988) Restricted edge-colourings. PhD Thesis University of Cambridge.
14. Häggkvist, R. and Thomason, A. G. (1995) Oriented Hamilton Cycles in Digraphs. J. Graph Theory 19(4) 471-479.
15. Jaeger, F. (1989) On the Penrose number of cubic diagrams. Discrete Mathematics 74 85-97.
16. Janssen, J. C. M. (1993) Even and odd latin squares. PhD Thesis Lehigh University.
17. Janssen, J. C. M. (1993) The Dinitz Problem Solved for Rectangles. AMS Bulletin 29 (2) 243-249.
18. Johansson, A. (1997) An estimate on the chromatic number for triangle free graphs. In preparation.
19. Johansson, A. (1997) An upper bound on the choice number for triangle free graphs. In preparation.
20. Kahn, J. (1996) Asymptotically good list-colorings. J. Combin. Theory (A) 73(1) 1-59.
21. Kim, J. H. (1993) PhD Thesis, Rutgers University.
22. Kostochka, A. V. (1992) Edge chromatic number of graphs with large girth. Discrete Math. 101 189-201.
23. Thomassen, C. (1994) Every planar graph is 5-choosable. J. Combin. Theory (B) 62(1) 180-181.
24. Vigneron, L. (1946) Remarques sur les résaux cubiques de classe 3 associés au probléme des quatre couleurs. C. R. Acad. Sc. Paris t.223 770-772.
25. Vizing, V. G. (1976) Colouring the vertices of a graph in prescribed colours (in Russian). Diskret. Analiz (29). Melody Diskret. Anal. v Teorii Kodov i Shem 101 3-10, (MR58#16371).
26. Vizing, V. G. (1976) Colouring the vertices of a graph in prescribed colours (in Russian). Diskret. Analiz (29). Melody Diskret. Anal. v Teorii Kodov i Shem 101 3-10, (MR58#16371).
27. Voigt, M. List colourings of planar graphs. Manuscript, Institut für Mathematik, TU Ilmenau, Germany.