[1]

N. Alon, S. Friedland, andG. Kalai: Regular subgraphs of almost regular graphs,*J. Combinatorial Theory*, Ser. B**37** (1984), 79–91.

[2]

N. Alon, C. McDiarmid, andB. Reed: Star Arboricity, to appear.

[3]

N. Alon, andM. Tarsi: A nowhere zero point in linear mappings,*Combinatorica*
**9** (1989), 393–395.

[4]

J. A. Bondy, R. Boppana, andA. Siegel: Private communication.

[5]

C. Berge:*Graphs and Hypergraphs*, Dunod, Paris, 1970.

[6]

B. Bollobás:*Extremal Graph Theory*, Academic Press, New York, 1978.

[7]

A. Chetwynd, andR. Häggkvist: A note on list colorings,*J. Graph Theory*
**13** (1989), 87–95.

[8]

P. Erdős: Some old and new problems in various branches of combinatorics,*Congressus Numerantium*
**23** (1979), 19–37.

[9]

P. Erdős, A. Rubin, andH. Taylor: Choosability in graphs,*Congressus Numerantium*
**26** (1979), 125–157.

[10]

I. Gessel: Tournaments and Vandermonde's determinant,*J. Graph Theory*
**3** (1979), 305–307.

[11]

R. L. Graham, S.-Y. R. Li, andW.-C. W. Li: On the structure of*t*-designs,*SIAM J. Alg. Disc. Meth.*
**1** (1980), 8–14.

[12]

S.-Y. R. Li, andW.-C. W. Li: Independence numbers of graphs and generators of ideals,*Combinatorical*
**1** (1981), 55–61.

[13]

R. P. Stanley: Acyclic orientations of graphs,*Discrete Math.*
**5** (1973), 171–178.

[14]

M. Tarsi: On the decomposition of a graph into stars,*Discrete Math.*
**36** (1981), 299–304.

[15]

V. G. Vizing: Coloring the vertices of a graph in prescribed colors (in Russian),*Diskret. Analiz.*
**29**,*Metody Discret. Anal. v. Teorii Kodov i Shem*
**101** (1976), 3–10.