[1] BONDY J A,MUTY U S R.Graph Theroy with Application [M].New York:Am Elsvier,1976.
[2] GAREY M R,JOHNSON D S.Crossing Number is NP-Complete [J].SIAN J. Algebraic. Discrete Methods,1993,4:312-316.
[3] ASANO K.The Crossing Number of K1,3,n and K2,3,n [J].J. Graph Theroy,1986,10:1-8.
[4] KLESC M.The Crossing Number of K2,3 Pn and K2,3Sn [J].Tatra,Mountains Math. Publ.,1996,9:51-56.
[5] KLEITMAN D J.The Crossing Numbers of K5,n [J].J. Combinatorial Theory,1970,9:315-323.
[6] KLESC M.The Crossing Numbers of Products of Paths with 5-Vertex Graphs [J].J. Disc. Math.,2001,233:353-359.
[7] ERDOS P,GUG R K.Crossing Number Problems [J].Am. Math. Maonth,1973,80:52-58.
[8] 肖文兵,黄元秋.S5及Gi与Pn的笛卡尔积交叉数 [J].湖南师范大学学报:自然科学版,2004(3):12-24.
[9] BEINEKE L W,RINGEISEN R D.The Crossing Numbers of C×Cn [J].J. Comb. Theory(B),1978,23(2):134-136. |
