1. Sur l'existence de deux cycles supplémentaires unicolorés disjoints et de couleurs différentes dans un graphe complet bicolore;Ayel,1979
2. A. Bialostocki and P. Dierker, “Monochromatic Connected Subgraphs in a Multicoloring of the Complete Graph”, Manuscript.
3. On (n, k)-colorings of complete graphs;Bierbrauer,1987
4. The Ramsey number of a graph with bounded maximum degree;Chvatal;J. Combin. Theory Ser. B,1983
5. On maximal paths and circuits of graphs;Erdős;Acta Math. Acad. Sci. Hungar.,1959