Geodesic
Extremal Crossing Numbers of Complete $k$-Chromatic Graphs
Mathematica slovaca, Tome 20 (1970) no. 4, pp. 315-325
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C10, 05C15, 05C35 
@article{MASLO_1970_20_4_a10,
     author = {Koman, Milan},
     title = {Extremal {Crossing} {Numbers} of {Complete} $k${-Chromatic} {Graphs}},
     journal = {Mathematica slovaca},
     pages = {315--325},
     year = {1970},
     volume = {20},
     number = {4},
     mrnumber = {0325431},
     zbl = {0209.27902},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1970_20_4_a10/}
}
TY  - JOUR
AU  - Koman, Milan
TI  - Extremal Crossing Numbers of Complete $k$-Chromatic Graphs
JO  - Mathematica slovaca
PY  - 1970
SP  - 315
EP  - 325
VL  - 20
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1970_20_4_a10/
LA  - en
ID  - MASLO_1970_20_4_a10
ER  - 
%0 Journal Article
%A Koman, Milan
%T Extremal Crossing Numbers of Complete $k$-Chromatic Graphs
%J Mathematica slovaca
%D 1970
%P 315-325
%V 20
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1970_20_4_a10/
%G en
%F MASLO_1970_20_4_a10
Koman, Milan. Extremal Crossing Numbers of Complete $k$-Chromatic Graphs. Mathematica slovaca, Tome 20 (1970) no. 4, pp. 315-325. http://geodesic.mathdoc.fr/item/MASLO_1970_20_4_a10/

[1] Beineke L. W.: Topological aspects of complete graphs, Theory of graphs. Proc. Colloq. Tihany, Hungary 1966, Akadémiai Kiadó, Budapest 1968, 19-26. | MR

[2] Zarankiewicz K.: On a problem of P. Turán concerning graphs. Fund. Math. 41 (1955), 137-145. | MR

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

[4] Harary R., Hill А.: On the number of crossings in a complete graph. Proc. Edin. Math. Soc., 2 (1962-63), 333-338. | MR

[5] Blažеk J., Koman M.: A minimal problem concerning complete plane graphs, Theory of graphs and its applications. Proc. Symp. Smolеnicе 1963, Praquе 1964, 113-117. | MR

[6] Saaty T. L.: On thе minimum number of intersections for complete graphs. Proc. Nat. Аcad. Sci., USА 50 (1964), 688-690. | MR

[7] Moon J. W.: On the distribution of crossings in random complete graphs. SIАM J. Аppl. Math. 13 (1965), 506-510. | MR | Zbl

[8] Guy R. K., Jеnkyns T., Schaеr J.: The toroidal crossing number of complete graph. J. Comb. Thеory, 4 (1968), З76-З90. (Thе Univеrsity of Calgary, Rеsеarch papеr 18 (1967), 1-20.) | MR

[9] Blažеk J., Koman M.: On an extremal problem concerning graphs. Commеntationеs Math. Univ. Carolinaе 8 (1967), 49-52. | MR

[10] Koman M.: Zobecnӗní problémů P. Erdöse a P. Turána pro úplné k-grafy a Generalisation of a problem of P. Erdès and P. Turán for complete k-graphs). Dissеrtation, MÚ ČSАV, Praguе 1967.

[11] Blažеk J., Koman M.: Průsečíkové číslo k-chromatických grafû (The crossing number of complete k-chromatic graphs). Sborník Pеd. fak. v Prazе - Matеmatika, to appеar.

[12] Harborth H.: unpublishеd.