Choosability and fractional chromatic numbers

Discrete Mathematics

Volumn 165-166, Issue , 1997, Pages 31-38

  Alon, N ^a   Tuza, Zs ^b   Voigt, M ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002443622     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00159-8     Document Type: Article

References (9)

1. N. Alon, Restricted colorings of graphs, in: K. Walker, ed., Surveys in Combinatorics, Proc. 14th British Combinatorial Conf., London Math. Soc. Lecture Notes Series, vol. 187 (Cambridge Univ. Press, Cambridge, 1993) 1-33.
2. N. Alon and K. Berman, Regular hypergraphs, Gordon's lemma, Steinitz's lemma and invariant theory, J. Combin. Theory Ser. A 43 (1986) 91-97.
3. N. Alon, D.J. Kleitman, C. Pomerance, M. Saks and P. Seymour, The smallest n-uniform hypergraph with positive discrepancy, Combinatorica 7 (1987) 151-160.
4. P. Erdös, A.L. Rubin and H. Taylor, Choosability in graphs, in: Proc. West-Coast Conf. on Combinatorics, Graph Theory and Computing; Congr. Numer. XXVI (1979) 125-157.
5. J.E. Graver, A survey of the maximum depth problem for indecomposable exact covers, in: Infinite and Finite Sets, Colloq. Math. Soc. Jânos Bolyai (1973) 731-743.
6. S. Gutner, M.Sc. Thesis, Tel Aviv University, 1992.
7. Zs. Tuza and M. Voigt, On a conjecture of Erdos, Rubin and Taylor, Tatra Mountains Mathematical Publications 9 (1996) 69-82.
8. Zs. Tuza and M. Voigt, Every 2-choosable graph is (2m,m)-choosable, J. Graph Theory 22 (1996) 245-252.
9. V.G. Vizing, Coloring the vertices of a graph in prescribed colors (in Russian), Diskret. Analiz. No. 29, Metody Diskret. Anal, v Teorii Kodov i Shem 101 (1976) 3-10.