1. A. Bialostocki P. Dierker W. Voxman Either a graph or its complement is connected-a continuing saga 2001
2. Generalizing the Ramsey problem through diameter;Dhruv;Electron. J. of Combin.,2002
3. P. Erdős T. Fowler Finding Large p -Coloured Diameter Two Subgraphs 15 1 1999 21 27
4. Covering the complete graph by partitions;Füredi;Discrete Math.,1989
5. Partition coverings and blocking sets in hypergraphs (in hungarian);Gyárfás;Comm Comput Automat Res Inst Hngar Acad Sci,1977