Choosability and fractional chromatic numbers
Authors:
- N. AlonNAN. Alon
- Zs. TuzaZTZs. Tuza
- M. VoigtMVM. Voigt
- 1 March 1997
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 165-166, 31-38
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Every 2-choosable graph is (2m, m)-choosableJournal of Graph Theory, 1996
- The smallestn-uniform hypergraph with positive discrepancyCombinatorica, 1987
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theoryJournal of Combinatorial Theory, Series A, 1986