[1] Zarankiewicz K.: On a Problem of P. Turán conceraing graphs. Fund. Math. 41 (1954), 137-145. MR 0063641

[2] Urbanik K.: Solution du problème posé par P. Turán. Çolloq. Math. 3 (1955), 200-201.

[3] Guy R. K.: A combinatorial problem. Bull. Malayan Math. Soc. 7 (1960), 68-72.

[4] Harary F., Hill A.: On the number of crossings in a complete graph. Proc. Edinburgh Math. Soc. (2), 13 (1962-3), 333-338. MR 0163299

[5] Blažek J., Koman M.: A minimal problem concerning complete plane graphs. Theory of graphs and its applications, editoг M. Fiedler, Proc. Symp. Smolenice Јune 1963, Prague 1964, 113-117. MR 0174042

[6] Saaty T. L.: The minimum number of inteгsections in complete graphs. Proc. Nat. Acad. Sci., U.S.A., 52 (1964), 688-690. MR 0166772

[7] Guy R. K., Jenkyns T. A., Schaer J.: The toroidal crossing number of complete graph. (Univ. Calgary, Research paper 18 (1967), 1-20.) J. Comb. Theory, 4, (1968), 376-390. MR 0220630

[8] Blažek J., Koman M.: On an extremal problem concerning graphs. CMUC, 8, 1 (1967), 49-52. MR 0210620 | Zbl 0166.19901

[9] Blažek J., Koman M.: The crossing number of complete $k$-chromatic graphs. (in Czech), Matemat., Sborník Ped., fak. UK Praha 1970, 69-84. MR 0277431

[10] Harborth H: Über die Kreuzungszahl vollständiger, $n$-geteilter Graphen. Math. Nach- richten, 48 (1971), 179-188. MR 0288050 | Zbl 0219.05053

[11] Guy R. K., Jenkyns T. A.: The toroidal crossing number of $K_{m,n}$. J. Comb. Theory, 6 (1969), 235-250. MR 0237372

[12] Koman M.: On the crossing number of graphs. Acta Univ. Carol. Math. Phys., 10 (1969), 9-46.

[13] Koman M.: A note on the crossing numbeг of $K_{m,n}$ on the Klein bottle. Recent Advanc. in Graph Theory, Proc Symp. Praque, June 1973, Editoг M. Fiedler, Acad. Praque 1975, 327-334. MR 0404029

[14] Guy R. K., Hill A.: The crossing number of the complement of a circuit. Discr. Math., 5 (1973), 335-344. MR 0316285 | Zbl 0271.05105