Parity of numbers of crossings for complete -partite graphs
Mathematica Slovaca (1976)
- Volume: 26, Issue: 2, page 77-95
- ISSN: 0232-0525
Access Full Article
top
How to cite
topHarborth, Heiko. "Parity of numbers of crossings for complete $n$-partite graphs." Mathematica Slovaca 26.2 (1976): 77-95. <http://eudml.org/doc/33976>.
@article{Harborth1976,
author = {Harborth, Heiko},
journal = {Mathematica Slovaca},
language = {eng},
number = {2},
pages = {77-95},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Parity of numbers of crossings for complete $n$-partite graphs},
url = {http://eudml.org/doc/33976},
volume = {26},
year = {1976},
}
TY - JOUR
AU - Harborth, Heiko
TI - Parity of numbers of crossings for complete $n$-partite graphs
JO - Mathematica Slovaca
PY - 1976
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 26
IS - 2
SP - 77
EP - 95
LA - eng
UR - http://eudml.org/doc/33976
ER -
References
top- GUY R. K., Crossing numbers of graphs, In: Graph theory and applications, Springer Lecture Notes in Mathematics 303, 1972, 111-124. (1972) Zbl0249.05107MR0337673
- HARBORTH H., Über die Kreuzungszahl vollständiger, n-geteilter Graphen, Math. Nachr. 48, 1971, 179-188. (1971) Zbl0219.05053MR0288050
- KLEITMAN D. J., The crossing number of K5,n, J. Combin. Theory 9, 1970, 315-323. (1970) MR0280403
- KOMAN M., On the crossing numbers of graphs, Acta Univ. Carolinae, Math. Phys. 10, 1969, 9-46. (1969) Zbl0256.05103MR0288049
NotesEmbed ?
topYou 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.