|
[1]
|
{1}BONDY J A, MURTY U S R. Graph Theory with Applications[M]. New York: Macmilan Ltd Press, 1976.{2}GAREY M R, Johnson D J. Crossing number is NP-complete [J]. Slam J Alg Disc Methods, 1983(4): 312-316.{3}KLEITMAN D J. The crossing number of $K_{5, n}$[J]. J Combin Theory, 1971, 9: 315-323.{4}WOODALL D R. Cyclic-order graphs and Zarankiewicz's crossing number conjecture[J]. J Graph Theory, 1993, 17(6): 657-671.{5}OPOROWSKI B, ZHAO D. Coloring graphs with crossings[J]. Discrete Mathematics, doi;10,1016/j.disc, 2008.07.040.{6}TANG L, WANG J, HUANG Y Q. The crossing number of the join of $C_{n}$ and $P_{n}$[J]. International J Math Com, 2007(11): 110-116.{7}PAK Tung Ho. On the crossing number of some complete multipartite graph [J]. Utilitas Mathematica, 2009, 79: 154-143.{8}PAK Tung Ho. The crossing number of $K_{2,2,2,n}$ [J]. Far East Journal of Applied Mathematics, 2008, 30(1): 43-69.{9}ASANO K. The crossing number of $K_{1, 3, n}$ and $K_{2, 3, n}$[J]. J Graph Theory, 1986(10): 1-8.
|
点击查看大图
下载: