Geodesic
New upper bounds for the crossing number of $K_n$ on the Klein bottle
Časopis pro pěstování matematiky, Tome 103 (1978) no. 3, pp. 282-288

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CPM.1978.117984
Classification : 05C10 
Koman, Milan. New upper bounds for the crossing number of $K_n$ on the Klein bottle. Časopis pro pěstování matematiky, Tome 103 (1978) no. 3, pp. 282-288. doi: 10.21136/CPM.1978.117984
@article{10_21136_CPM_1978_117984,
     author = {Koman, Milan},
     title = {New upper bounds for the crossing number of $K_n$ on the {Klein} bottle},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {282--288},
     year = {1978},
     volume = {103},
     number = {3},
     doi = {10.21136/CPM.1978.117984},
     mrnumber = {506557},
     zbl = {0395.05029},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1978.117984/}
}
TY  - JOUR
AU  - Koman, Milan
TI  - New upper bounds for the crossing number of $K_n$ on the Klein bottle
JO  - Časopis pro pěstování matematiky
PY  - 1978
SP  - 282
EP  - 288
VL  - 103
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1978.117984/
DO  - 10.21136/CPM.1978.117984
LA  - en
ID  - 10_21136_CPM_1978_117984
ER  - 
%0 Journal Article
%A Koman, Milan
%T New upper bounds for the crossing number of $K_n$ on the Klein bottle
%J Časopis pro pěstování matematiky
%D 1978
%P 282-288
%V 103
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1978.117984/
%R 10.21136/CPM.1978.117984
%G en
%F 10_21136_CPM_1978_117984

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

[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

[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

[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

[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

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

[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

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

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

[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

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

Cité par Sources :