1. Choosability in graphs;Erdős;Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium,1979
2. Covering the vertex set of a graph with subgraphs of smaller degree
3. [15] Kahn J. and Szemerédi E. (1988) The second eigenvalue of a random regular graph, manuscript, (appeared as first chapter in: Friedman J. , Kahn J. and Szemerédi E. , On the second eigenvalue of a random regular graph, Proc. 21st STOC, ACM, 1989).
4. [20] N. Pippenger , unpublished.
5. [3] Alon N. , Restricted coloring of graphs. Proc. 14th British Combinatorial Conf. to appear.