A Note on Vertex List Colouring

Combinatorics Probability and Computing

Volumn 10, Issue 4, 2001, Pages 345-347

  Haxell, P E ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035633532     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548301004758     Document Type: Article

References (11)

1. Aharoni, R., Chudnovsky, M. and Kotlov, A. (2001) Triangulated spheres and multicolored cliques. Submitted.
2. Aharoni, R. and Haxell, P. (2000) Hall's theorem for hypergraphs. J. Graph Theory 35 83-88.
3. Aharoni, R. and Haxell, P. (1999) Systems of disjoint representatives. Preprint.
4. Alon, N. (1988) The linear arboricity of graphs. Israel J. Math. 62 311-325.
5. Alon, N. (1994) Probabilistic methods in coloring and decomposition problems. Discrete Math. 127 31-46.
6. Alon, N. and Spencer, J. (1992) The Probabilistic Method, Wiley-Interscience.
7. Bollobás, B., Erdos, P. and Szemerédi, E. (1975) On complete subgraphs of r-chromatic graphs. Discrete Math. 13 97-107.
8. Haxell, P. (1995) A condition for matchability in hypergraphs. Graphs and Combinatorics 11 245-248.
9. Meshulam, R. (2001) The clique complex and hypergraph matching. Combinatorica 21 89-94.
10. Reed, B. (1999) The list colouring constants. J. Graph Theory 31 149-153.
11. Yuster, R. (1997) Independent transversals in r-partite graphs. Discrete Math. 176 255-261.