1. Remarks on a paper of Gerencsér and Gyárfás;Andrásfai;Ann. Univ. Sci. Eötvös Budapest,1970
2. A. Bialostocki, P. Dierker, W. Voxman, Either a graph or its complement is connected: a continuing saga, manuscript, 2001.
3. A. Bialostocki, W. Voxman, Monochromatic trees and a rainbow forest on four edges, preprint.
4. On generalized Ramsey numbers for trees;Bierbrauer;Combinatorica,1985
5. On (n,k)-colorings of complete graphs;Bierbrauer;Congressus Num.,1987