Previous |  Up |  Next

Article

Title: Extremal Crossing Numbers of Complete $k$-Chromatic Graphs (English)
Author: Koman, Milan
Language: English
Journal: Matematický časopis
ISSN: 0025-5173
Volume: 20
Issue: 4
Year: 1970
Pages: 315-325
.
Category: math
.
MSC: 05C10
MSC: 05C15
MSC: 05C35
idZBL: Zbl 0209.27902
idMR: MR0325431
.
Date available: 2009-09-25T08:10:53Z
Last updated: 2012-07-31
Stable URL: http://hdl.handle.net/10338.dmlcz/126547
.
Reference: [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 0232702
Reference: [2] Zarankiewicz K.: On a problem of P. Turán concerning graphs.Fund. Math. 41 (1955), 137-145. MR 0063641
Reference: [3] Guy R. K.: A combinatorial problem.Bull. Malayan Math. Soc. 1 (1960), 68-72.
Reference: [4] Harary R., Hill А.: On the number of crossings in a complete graph.Proc. Edin. Math. Soc., 2 (1962-63), 333-338. MR 0163299
Reference: [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 0174042
Reference: [6] Saaty T. L.: On thе minimum number of intersections for complete graphs.Proc. Nat. Аcad. Sci., USА 50 (1964), 688-690. MR 0166772
Reference: [7] Moon J. W.: On the distribution of crossings in random complete graphs.SIАM J. Аppl. Math. 13 (1965), 506-510. Zbl 0132.40305, MR 0179106
Reference: [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 0220630
Reference: [9] Blažеk J., Koman M.: On an extremal problem concerning graphs.Commеntationеs Math. Univ. Carolinaе 8 (1967), 49-52. MR 0210620
Reference: [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.
Reference: [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.
Reference: [12] Harborth H.: .unpublishеd.
.

Files

Files Size Format View
MathSlov_20-1970-4_11.pdf 1.111Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo