Relations between crossing numbers of complete and complete bipartite graphs

被引：42

作者：

Richter, RB ^{[1
]}

Thomassen, C ^{[1
]}

机构：

[1] TECH UNIV DENMARK,INST MATH,DK-2800 LYNGBY,DENMARK

来源：

关键词：

D O I：

10.2307/2974980

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：131 / 137

页数：7

共 7 条

[1]

[Anonymous], 2001, GRAPH THEORY

[2] CROSSING NUMBER IS NP-COMPLETE [J].

GAREY, MR ;

JOHNSON, DS .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (03) :312-316

[3]

Guy R. K., 1969, PROOF TECHNIQUES GRA, P63

[4]

Kleitman D. J., 1970, Journal of Combinatorial Theory, Series A, V9, P315, DOI 10.1016/S0021-9800(70)80087-4

[5]

Turan P., 1977, J. Graph Theory, V1, P7, DOI [10.1002/jgt.3190010105, DOI 10.1002/JGT.3190010105]

[6]

WHITE AT, SELECTED TOPICS GRAP

[7] CYCLIC-ORDER GRAPHS AND ZARANKIEWICZS CROSSING-NUMBER CONJECTURE [J].

WOODALL, DR .