New upper bounds for the crossing number of K n on the Klein bottle

Milan Koman

Časopis pro pěstování matematiky (1978)

  • Volume: 103, Issue: 3, page 282-288
  • ISSN: 0528-2195

How to cite

top

Koman, Milan. "New upper bounds for the crossing number of $K_n$ on the Klein bottle." Časopis pro pěstování matematiky 103.3 (1978): 282-288. <http://eudml.org/doc/21350>.

@article{Koman1978,
author = {Koman, Milan},
journal = {Časopis pro pěstování matematiky},
keywords = {Crossing Number; Torus; Klein Bottle},
language = {eng},
number = {3},
pages = {282-288},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {New upper bounds for the crossing number of $K_n$ on the Klein bottle},
url = {http://eudml.org/doc/21350},
volume = {103},
year = {1978},
}

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
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 103
IS - 3
SP - 282
EP - 288
LA - eng
KW - Crossing Number; Torus; Klein Bottle
UR - http://eudml.org/doc/21350
ER -

References

top
  1. Zarankiewicz K., On a Problem of P. Turán conceraing graphs, Fund. Math. 41 (1954), 137-145. (1954) Zbl0055.41605MR0063641
  2. Urbanik K., Solution du problème posé par P. Turán, Çolloq. Math. 3 (1955), 200-201. (1955) 
  3. Guy R. K., A combinatorial problem, Bull. Malayan Math. Soc. 7 (1960), 68-72. (1960) 
  4. Harary F., Hill A., On the number of crossings in a complete graph, Proc. Edinburgh Math. Soc. (2), 13 (1962-3), 333-338. (1962) Zbl0118.18902MR0163299
  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. (1963) Zbl0161.20601MR0174042
  6. Saaty T. L., The minimum number of inteгsections in complete graphs, Proc. Nat. Acad. Sci., U.S.A., 52 (1964), 688-690. (1964) Zbl0126.39301MR0166772
  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. (1967) Zbl0172.48804MR0220630
  8. Blažek J., Koman M., On an extremal problem concerning graphs, CMUC, 8, 1 (1967), 49-52. (1967) Zbl0166.19901MR0210620
  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. (1970) Zbl0218.05054MR0277431
  10. Harborth H, Über die Kreuzungszahl vollständiger, n -geteilter Graphen, Math. Nach- richten, 48 (1971), 179-188. (1971) Zbl0219.05053MR0288050
  11. Guy R. K., Jenkyns T. A., The toroidal crossing number of K m , n , J. Comb. Theory, 6 (1969), 235-250. (1969) Zbl0176.22303MR0237372
  12. Koman M., On the crossing number of graphs, Acta Univ. Carol. Math. Phys., 10 (1969), 9-46. (1969) Zbl0256.05103
  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. (1973) MR0404029
  14. Guy R. K., Hill A., The crossing number of the complement of a circuit, Discr. Math., 5 (1973), 335-344. (1973) Zbl0271.05105MR0316285

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.