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

Authors:
Roland Häggkvist;Jeannette Janssen
Affiliations:
Department of Mathematics, University of Umeå, S-901 87 Umeå, Sweden (e-mail: haggkvist@mathdept.umu.se);Department of Mathematics, London School of Economics, Houghton Street, London WC2A 2AE, UK (e-mail: janssen@cdam.lse.ac.uk)
Venue:
Combinatorics, Probability and Computing
Year:
1997

Towards a solution of the Dinitz problem?

Discrete Mathematics
A new upper bound for the list chromatic number

Discrete Mathematics - Graph colouring and variations
On the penrose number of cubic diagrams

Discrete Mathematics - Graph colouring and variations
List edge chromatic number of graphs with large girth

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Some upper bounds on the total and list chromatic numbers of multigraphs

Journal of Graph Theory
Restricted colorings of graphs

Surveys in combinatorics, 1993
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
The list chromatic index of a bipartite multigraph

Journal of Combinatorial Theory Series B
Oriented Hamilton cycles in digraphs

Journal of Graph Theory
Asymptotically good list-colorings

Journal of Combinatorial Theory Series A

Hi-index	0.00

We determine lower bounds for the number of random binary vectors, chosen uniformly from vectors of weight k, needed to obtain a dependent set.