×

zbMATH — the first resource for mathematics

A survey of graphs with known or bounded crossing numbers. (English) Zbl 1453.05024
Summary: We present, to the best of the authors’ knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories: specifically, results for general graph families, results for graphs arising from various graph products, and results for recursive graph constructions.
Reviewer: Reviewer (Berlin)
MSC:
05C10 Planar graphs; geometric and topological aspects of graph theory
05C75 Structural characterization of families of graphs
05C76 Graph operations (line graphs, products, etc.)
Software:
OGDF
PDF BibTeX XML Cite
Full Text: Link
References:
[1] Bernado M. ´Abrego, Oswin Aichholzer, Silvia Fern´andez-Merchant, Thomas Hackl, J¨urgen Pammer, Alexander Pilz, Pedro Ramos, Gelasio Salazar and Birgit Vogtunhuber, All Good Drawings of Small Complete Graphs, In:Proc. 31st European Workshop on Computational Geometry (EuroCG)(2015), pp. 57-60.
[2] Eyal Ackerman, On topological graphs with at most four crossings per edge, Comp. Geom., 85 (2019), 101574. · Zbl 1439.05163
[3] Jay Adamsson and R. Bruce Richter, Arrangements, circular arrangements and the crossing number ofC7×Cn,J. Combin. Th. Series B, 90(1) (2004), 21-39. · Zbl 1033.05026
[4] Martin Aigner and G¨unter M. Ziegler,Proofs from THE BOOK,SpringerVerlag Berlin Heidelberg (2010), pp. 261-268. · Zbl 1185.00001
[5] Mikl´os Ajtai, Vaˇsek Chv´atal, Monroe M. Newborn and Endre Szemer´edi, Crossing-free subgraphs,North-Holland Math. Stud., 60(C) (1982), 9-12.
[6] Sheldon B. Akers and Balakrishnan Krishnamurthy, A group-theoretic model for symmetric interconnection networks,IEEE Trans. Comput., 38 (1989), 555-566. · Zbl 0678.94026
[7] Michael O. Albertson, Daniel W. Cranston and Jacob Fox, Crossings, colorings and cliques,Elec. J. Combin., 16, Note 45 (2010). · Zbl 1182.05035
[8] Mark Anderson, R. Bruce Richter and Peter Rodney, The Crossing Number ofC6×C6,Congr. Numer., 118 (1996), 97-107. · Zbl 0896.05032
[9] Mark Anderson, R. Bruce Richter and Peter Rodney, The Crossing Number ofC7×C7,Congr. Numer., 125 (1996), 97-117. · Zbl 0894.05012
[10] Kouhei Asano, The crossing number ofK1,3,nandK2,3,n,J. Graph Th., 10 (1986), 1-8. · Zbl 0586.05014
[11] J´ozsef Balogh, Bernard Lidick´y and Gelasio Salazar,Closing in On Hill’s Conjecture,SIAM J. Discr. Math., 33(3) (2019), 1261-1276. · Zbl 1419.05050
[12] J´anos B´arat and G´eza T´oth,Towards the Albertson conjecture,Elec. J. Combin., 17, Note 73 (2010).
[13] Lowell W. Beineke and Richard D. Ringeisen, On the crossing numbers of products of cycles and graphs of order four,J. Graph Th., 4(2) (1980), 145- 155. · Zbl 0403.05037
[14] Lowell W. Beineke and Robin Wilson, The Early History of the Brick Factory Problem,Math. Int., 32(2) (2010), 41-48. · Zbl 1226.05093
[15] Vaclav E. Beneˇs, Permutation groups, complexes, and rearrangeable connecting networks,Bell System Tech. J., 43(4) (1964), 1619-1640. · Zbl 0129.30802
[16] ˇStefan Bereˇzn´y and Michal Staˇs, On the crossing number of the join of five vertex graphGwith the discrete graphDn,Acta Elec. Inf., 17(3) (2017), 27-32.
[17] Drago Bokal, On the crossing number of Cartesian products with paths,J. Comb. Th. Series B, 97(3) (2007), 381-384. · Zbl 1113.05027
[18] Drago Bokal, On the crossing numbers of Cartesian products with trees,J. Graph Th., 56 (20007), 287-300. · Zbl 1128.05017
[19] Drago Bokal, Zden˘ek Dvo˘r´ak, Petr Hlin˘en´y, Jes´us Lea˜os, Bojan Mohar and Tilo Wiedera, Bounded degree conjecture holds precisely forc-crossing critical graphs withc≤12, (2019),arXiv:1903.05363.
[20] Gek L. Chia and Chan L. Lee, Crossing Numbers of Nearly Complete Graphs and Nearly Complete Bipartite Graphs,Ars Combin., 121 (2015), 437-446. · Zbl 1363.05185
[21] Markus Chimani, Carsten Gutwenger, Michael J¨unger, Gunnar W Klau, Karsten Klein and Petra Mutzel,The Open Graph Drawing Framework (OGDF),Handbook of Graph Drawing and Visualization, (2011), pp. 543-569.
[22] Markus Chimani and Tilo Wiedera, An ILP-based Proof System for the Crossing Number Problem, In:LIPIcs-Leibniz International Proceedings in Informatics, vol. 57. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, (2016). · Zbl 1397.68138
[23] Markus Chimani and Tilo Wiedera,Crossing Number Web Compute, http://crossings.uos.de, (2016). · Zbl 1397.68138
[24] Sheshayya A. Choudum and Vadivel Sunitha, Augmented Cubes,Networks, 40 (2002), 71-84. · Zbl 1019.05052
[25] Robin Christian, R. Bruce Richter and Gelasio Salazar, Zarankiewicz’s conjecture is finite for each fixedm,J. Comb. Th. Ser. B, 103(2) (2013), 237-247. · Zbl 1262.05030
[26] Robert Cimikowski, Topological Properties of Some Interconnected Network Graphs,Congr. Numer., 121 (1996), 19-32. · Zbl 0895.68013
[27] Robert Cimikowski, Crossing number bounds for the mesh of trees,Congr. Numer., 129 (1998), 107-116. · Zbl 0952.05019
[28] Robert Cimikowski and Imrich Vrt’o, Improved bounds for the crossing number of the mesh of trees,J. Interconnect. Net., 4(1) (2003), 17-35.
[29] Kieran Clancy, Michael Haythorpe and Alex Newcombe, An effective crossing minimisation heuristic based on star insertion,J. Graph Alg. App., 23(2) (2019), 135-166. · Zbl 1407.05220
[30] Harold S.M. Coxeter, Self-Dual Configurations and Regular Graphs,Bull. Amer. Math. Soc., 56 (1950), 413-455. · Zbl 0040.22803
[31] Caselyn D.C. Cruz and Danica M. Japson, The crossing number of the generalized Petersen graphP(17, K), whereK≤ 17,Undergraduate Thesis,
[32] Etienne de Klerk, John Maharry, Dmitrii V. Pasechnik, R. Bruce Richter and Gelasio Salazar, Improved bounds for the crossing numbers ofKm,nandKn, SIAM J. Discr. Math., 20 (2006), 189-202.
[33] Etienne de Klerk, Dmitrii V. Pasechnik and Alexander Schrijver, Reduction of symmetric semidefinite programs using the regular∗-representation,Math. Prog. Ser. B, 109 (2007), 613-624. · Zbl 1200.90136
[34] Alice M. Dean and R. Bruce Richter, The crossing number ofC4×C4,J. Graph Th., 19(1) (1995), 125-129. · Zbl 0813.05018
[35] Zongpeng Ding and Yuanqiu Huang, The crossing numbers of join of some graphs withnisolated vertices,Disc. Math. Graph Th., 38 (2018), 899-909. · Zbl 1392.05030
[36] Zongpeng Ding, Yuanqiu Huang and Zhangdong Ouyang, The crossing numbers of Cartesian products of paths with some graphs,Ars Combin., 141 (2018), 101-110. · Zbl 06986935
[37] Em´ılia Draˇzensk´a,The crossing number ofG2Cnfor the graphGon six vertices,Math. Slovaca, 61(5) (2011), 675-686.
[38] Em´ılia Draˇzensk´a and Mari´an Kleˇsˇc, The crossing numbers of products of the graphK2,2,2with stars,Carpathian J. Math., 24(3) (2008), 327-331.
[39] Em´ılia Draˇzensk´a and Mari´an Kleˇsˇc, On the crossing numbers ofG2Cnfor graphsGon six vertices,Disc. Math. Graph Th., 31(2) (2011), 239-252.
[40] Roger B. Eggleton and Richard K. Guy, The crossing number of then-cube, Notices Amer. Math. Soc., 17(5) (1970), 757.
[41] Paul Erd˝os and Richard K. Guy, Crossing Number Problems,Amer. Math. Monthly, 80(1) (1973), 52-58.
[42] Geoffrey Exoo, Frank Harary and Jerald Kabell, The crossing numbers of some generalized Petersen graphs,Math. Scand., 48 (1981), 184-188. · Zbl 0442.05021
[43] Luerbio Faria, Celina M.H. de Figueiredo, On Eggleton and Guy’s Conjectured Upper Bound for the Crossing Number of then-cube,Math. Slovaca, 50(3) (2000), 271-287. · Zbl 0984.05027
[44] Luerbio Faria, Celina M.H. de Figueiredo, Ondrej S´ykora, and Imrich Vrt’o, An improved upper bound on the crossing number of the hypercube,J. Graph Th., 59(2) (2008), 145-161. · Zbl 1161.05025
[45] Stanley Fiorini, On the crossing number of generalized Petersen graphs,NorthHolland Math. Stud.123 (1986), 225-241.
[46] Stanley Fiorini and John Baptist Gauci, The crossing number of the generalized Petersen graphP(3k, k),Math. Bohemica, 128(4) (2003), 337-347. · Zbl 1050.05034
[47] Abbie Foley, Rachel Krieger, Adrian Riskin and Isabelle Stanton, The Crossing Numbers of Some Twisted Toroidal Grid Graphs,Bull. ICA, 36 (2002), 80-88. · Zbl 1013.05028
[48] Michael R. Garey and David S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Disc. Meth., 4(3) (1983), 312-316. · Zbl 0536.05016
[49] John Baptist Gauci and Cheryl Zerafa Xuereb, A note on isomorphic generalized Petersen graphs with an application to the crossing number ofGP[3k−1, k] andGP[3k+ 1, k],Disc. Math. Letters, 2 (2019), 44-46. · Zbl 1449.05077
[50] Ellen Gethner, Leslie Hogben, Bernard Lidick´y, Florian Pfender, Amanda Ruiz and Michael Young, On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs,J. Graph Th., 84(4) (2017), 552-565. · Zbl 1359.05027
[51] Lev Yu Glebsky and Gelasio Salazar, The crossing number ofCm×Cnis as conjectured forn≥m(m+ 1),J. Graph Th., 47(1) (2004), 53-72. · Zbl 1053.05032
[52] Carsten Gutwenger,Application of SPQR-Trees in the Planarization Approach for Drawing Graphs, PhD Thesis, Technical University of Dortmund, (2010).
[53] Richard K. Guy, A combinatorial problem,Bull. Malayan Math. Soc., 7 (1960), 68-72.
[54] Richard K. Guy, The decline and fall of Zarankiewicz’s theorem,Proof techniques in Graph Theory, F. Harary, ed., Academic Press, New York (1969), pp. 63-69.
[55] Richard K. Guy, Crossing numbers of graphs, In:Graph Theory and Applications, volume 303 ofLecture Notes in Mathematics, Spinger-Verlag, BerlinHeidelberg-New York, (1972), pp.111-124. · Zbl 0249.05107
[56] Richard K. Guy and Frank Harary, On the M¨obius ladders,Canad. Math. Bull.10 (1967), 493-496. · Zbl 0161.20602
[57] Richard K. Guy and Anthony Hill, The crossing number of the complement of a circuit,Disc. Math., 5 (1973), 335-344. · Zbl 0271.05105
[58] Frank Harary,Graph Theory, Addison-Wesley, Reading, MA, (1969). · Zbl 0182.57702
[59] Frank Harary and Anthony Hill, On the Number of Crossings in a Complete Graph,Proceedings of the Edinburgh Mathematical Society, 13(4) (1963), 333- 338. · Zbl 0118.18902
[60] Frank Harary and Paul C. Kainen, The Cube of a Path is Maximal Planar, Bull. ICA, 7 (1993), 55-56. · Zbl 0804.05046
[61] Frank Harary, Paul C. Kainen and Adrian Riskin, Every Graph of Cyclic Bandwidth 3 is Toroidal,Bull. ICA, 27 (1999), 81-84. · Zbl 0938.05025
[62] Frank Harary, Paul C. Kainen and Allen J. Schwenk, Toroidal graphs with arbitrarily high crossing numbers,Nanta. Math., 6(1) (1973), 58-67. · Zbl 0285.05104
[63] Heiko Harborth, ¨Uber die Kreuzungsahl vollst¨andiger,n-geteilter Graphen, Mathematische Nachrichten, 48 (1971), 179-188. · Zbl 0219.05053
[64] Michael Haythorpe and Alex Newcombe,On the Crossing Number of the Cartesian Product of a Sunlet Graph and a Star Graph,Bull. Austral. Math. Soc., 100 (2019), 5-12. · Zbl 1416.05241
[65] Peiling He, The Crossing Number of the Complete Bipartite Graph by Deleting Two Edgese1ande2,J. Hengyang Norm. Uni., 29(6) (2008), 23-25.∗
[66] Peiling He and Yuanqiu Huang, On the Crossing Numbers of Cartesian Product of a 6-vertice Graph and Paths,J. Hunan Inst. Hum. Sci. Tech., 2007(6) (2007), 3-5.∗ · Zbl 1174.05343
[67] Peiling He and Yuanqiu Huang, The crossing number ofW4×Sn,J. Zhengzhou Uni. (Nat. Sci. Ed.), 39(4) (2007), 14-18.∗ · Zbl 1174.05343
[68] Peiling He, Zhijun Luo and Yuanqiu Huang,Crossing Number of Several Complete Bipartite Graphs by Deleting One Edge,J. Henan Norm. Uni. Nat. Sci., 39(2) (2011), 24-26.∗
[69] Xioanian He, The Crossing Number of Cartesian Products of Stars with 5vertex Graphs II,Chin. Quart. J. Math., 26(4) (2011), 563-567. · Zbl 1265.05148
[70] Xiaonian He and Yuanqiu Huang, The Crossing Number of a Class of Cartesian Products,J. Jishou Uni. Nat. Sci. Ed., 26(1) (2005), 8-11.∗ · Zbl 1212.05055
[71] Pak Tung Ho, The crossing number ofK1,5,n,K2,4,nandK3,3,n,Int. J. Pure Appl. Math., 17(4) (2004), 491-515. · Zbl 1060.05026
[72] Pak Tung Ho, The crossing number ofC(3k+ 1;1, k),Disc. Math., 307(22) (2007), 2771-2774. · Zbl 1129.05012
[73] Pak Tung Ho, The crossing number ofK1,m,n,Disc. Math., 308(24) (2008), 5996-6002. · Zbl 1168.05018
[74] Pak Tung Ho, The crossing number ofK2,2,2,n,Far East J. Appl. Math., 30(1) (2008), 43-69. · Zbl 1148.05028
[75] Pak Tung Ho, On the crossing number of some complete multipartite graphs, Utilitas Math., 79 (2009), 125-143. · Zbl 1220.05025
[76] Pak Tung Ho, The Crossing Number ofK2,4,n,Ars Comb., 109 (2013), 527-537. · Zbl 1289.05337
[77] Sunyuan Hsieh and Chengchian Lin, The Crossing Number of Join Products of kth Power of PathPmwith Isolated Vertices and PathPn, In:Computer Symposium (ICS) 2016 International, IEEE, (2016), pp. 62-67.
[78] Yuanqiu Huang and Jing Wang, Survey of the crossing number of graphs,J. East China Normal Uni. Nat. Sci., 2010(3) (2010), 68-80. · Zbl 1240.05220
[79] Yuanqiu Huang and Tinglei Zhao, On the Crossing Number of the Complete TripartiteK1,6,n,Acta Math. Appl. Sinica, 29(6) (2006), 1046-1053. · Zbl 1118.05019
[80] Yuanqiu Huang and Tinglei Zhao, On the Crossing Number of the Complete TripartiteK1,8,n,Acta Math. Sinica, 26(7) (2006), 1115-1122. · Zbl 1118.05019
[81] Yuanqiu Huang and Tinglei Zhao, The crossing number ofK1,4,n,Disc. Math., 308(9) (2008), 1634-1638. · Zbl 1135.05016
[82] Rufus Isaacs, Infinite Families of Nontrivial Trivalent Graphs Which Are Not Tait Colorable,Amer. Math. Monthly, 82 (1975), 221-239. · Zbl 0311.05109
[83] Stanislav Jendrol’ and M´aria ˇScerbov´a, On the crossing numbers ofSm×Pn andSm×Cn.Casopis pro pestov´ani matematiky, 107 (1982), 225-230.
[84] Sandi Klavˇzar and Bojan Mohar, Crossing Numbers of Sierpi´nski-Like Graphs, J. Graph Th., 50(3) (2005), 186-198. · Zbl 1077.05030
[85] Daniel J. Kleitman, The crossing number ofK5,n,J. Combin. Th., 9 (1971), 315-323.
[86] Mari´an Kleˇsˇc, On the crossing numbers of Cartesian products of stars and paths or cycles,Math. Slovaca, 41(2) (1991), 113-120.
[87] Mari´an Kleˇsˇc, The crossing numbers of products of paths and stars with 4vertex graphs,J. Graph Th., 18(6) (1994), 605-614.
[88] Mari´an Kleˇsˇc, The crossing numbers of certain Cartesian products,Disc. Math. Graph Th., 15(1) (1995), 5-10.
[89] Mari´an Kleˇsˇc, The crossing number ofK2,3×PnandK2,3×Sn,Tatra Mountains Math. Publ., 9 (1996), 51-56.
[90] Mari´an Kleˇsˇc, The crossing number ofK5×Pn,Tatra Mountains Math. Pub., 18 (1999), 63-68.
[91] Mari´an Kleˇsˇc, The crossing numbers of products of a 5-vertex graph with paths and cycles,Disc. Math. Graph Th., 19(1) (1999), 59-69.
[92] Mari´an Kleˇsˇc, On the crossing numbers of products of stars and graphs of order five,Graphs Comb., 17(2) (2001), 289-294.
[93] Mari´an Kleˇsˇc, The crossing numbers of Cartesian products of paths with 5vertex graphs,Disc. Math., 233(1-3) (2001), 353-359.
[94] Mari´an Kleˇsˇc, The crossing number ofK2,3×C3,Disc. Math, 251(1-3) (2002), 109-117.
[95] Mari´an Kleˇsˇc, Some crossing numbers of products of cycles,Disc. Math. Graph Th., 25(1-2) (2005), 197-210.
[96] Mari´an Kleˇsˇc, The join of graphs and crossing numbers,Elec. Notes Disc. Math., 28 (2007), 349-355.
[97] Mari´an Kleˇsˇc, On the crossing numbers of Cartesian products of stars and graphs on five vertices, In: Fiala J., Kratochv´ıl J., Miller M. (eds)Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874, Springer, Berlin, Heidelberg, (2009), pp. 324-333.
[98] Mari´an Kleˇsˇc, The crossing numbers of join of the special graph on six vertices with path and cycle,Disc. Math., 310(9) (2010), 1475-1481.
[99] Mari´an Kleˇsˇc and Anna Koc´urov´a, The crossing numbers of products of 5vertex graphs with cycles,Disc. Math., 307(11-12) (2007), 1395-1403.
[100] Mari´an Kleˇsˇc and Daniela Kravecov´a, The crossing number ofP522Cn,Creat. Math. Inf., 17(3) (2008), 431-438.
[101] Mari´an Kleˇsˇc and Daniela Kravecov´a, The crossing number ofPn22C3,Disc. Math., 312(14) (2012), 2096-2101.
[102] Mari´an Kleˇsˇc, Daniela Kravecov´a and Jana Petrillov´a, The Crossing Numbers of Join of Special Graphs, In:Electrical Engineering and Informatics II: Proceedings of the Faculty of Electrical Engineering and Informatics of the Technical University of Koˇsice (2011), (2011), pp. 522-527.
[103] Mari´an Kleˇsˇc, Daniela Kravecov´a and Jana Petrillov´a, On the crossing numbers of Cartesian products of paths with special graphs, Carpathian J. Math., 30(3) (2014), 317-325.
[104] Mari´an Kleˇsˇc and Jana Petrillov´a, On the optimal drawings of products of paths with graphs,Acta Elec. Inf., 13(3) (2013), 56-61.
[105] Mari´an Kleˇsˇc and Jana Petrillov´a, The crossing numbers of products of paths with graphs of order six,Disc. Math. Graph Th., 33(3) (2013), 571-582.
[106] Mari´an Kleˇsˇc, Jana Petrillov´a and Mat´uˇs Valo, Minimal number of crossings in strong product of paths,Carpathian J. Math., 29(1) (2013), 27-32.
[107] Mari´an Kleˇsˇc, Jana Petrillov´a and Mat´uˇs Valo, On the crossing numbers of Cartesian products of wheels and trees,Disc. Math. Graph Th., 37(2) (2017), 399-413.
[108] Mari´an Kleˇsˇc, R. Bruce Richter and Ian Stobert, The crossing number of C5×Cn,J. Graph Th., 22(3) (1996), 239-243. · Zbl 0854.05036
[109] Mari´an Kleˇsˇc and ˇStefan Schr¨otter, The crossing numbers of join products of paths with graphs of order four,Disc. Math. Graph Th., 31(2) (2011), 321-331.
[110] Mari´an Kleˇsˇc and ˇStefan Schr¨otter, The Crossing Numbers of Join of Paths and Cycles with Two Graphs of Order Five, In:Mathematical Modeling and Computational Science, Springer, Berlin, Heidelberg, (2012), pp. 160-167.
[111] Mari´an Kleˇsˇc and ˇStefan Schr¨otter, On the crossing numbers of Cartesian products of stars and graphs of order six,Disc. Math. Graph Th., 33(3) (2013), 583-597.
[112] Mari´an Kleˇsˇc and Mat´uˇs Valo, Minimum crossings in join of graphs with paths and cycles,Acta Elec. Inf., 12(3) (2012), 32-37.
[113] Daniela Kravecov´a, The crossing number ofPn22C4,Acta Elec. Inf., 12(3) (2012), 42-46.
[114] Daniela Kravecov´a, The crossing number ofP52×Pn,Creat. Math. Inf., 28(1) (2012), 49-56.
[115] Frank T. Leighton,Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other NetworksMIT Press, Cambridge, MA, (1983).
[116] Frank T. Leighton, New Lower Bound Techniques for VLSI,Math. Sys. Th., 17(1) (1984), 47-70. · Zbl 0488.94048
[117] Bo Li, Jing Wang and Yuanqiu Huang, On the crossing number of the join of some 5-vertex graphs andPn,Int. J. Math. Comb., 2 (2008), 70-77.∗ · Zbl 1155.05013
[118] Bo Li, Jing Wang and Yuanqiu Huang, On the crossing number of the join of some 6-vertex graphs andPn,J. Jishou Uni. Nat. Sci. Ed. (China), 29(6) (2008), 29-35.∗
[119] Bo Li, Lixi Zhang and Yuanqiu Huang, The crossing number of Cartesian product of star with a 6-vertex graph,J. Hunan Uni. Arts Sci. Nat. Sci. Ed., 20(2) (2008), 6-11.∗ · Zbl 1174.05345
[120] Bo Li, Lixi Zhang and Yuanqiu Huang, Crossing Number of Products of Several 6-Vertex Graphs with Star,J. Shantou Uni. Nat. Sci. Ed., 24(4) (2009), 4-13.
[121] Liping Li, The Crossing Numbers of Join of a 5-Vertex Graph with Path and Cycle,Math. Prac. Th., 44(11) (2014), 203-211.∗
[122] Min Li, Crossing Numbers of Joins of Paths and Cycles with the Graph on Five Vertices,J. Hubei Uni. Arts Sci.33(11) (2012), 11-14.∗
[123] Min Li, Crossing Numbers of Join of the Graph on Five Vertices withnIsolated Vertices and Paths,J. Hubei Uni. Arts Sci., 34(11) (2013), 15-17.∗
[124] Min Li, The Crossing Numbers of Join of Some 5-Vertex Graphs with Paths and Cycles,J. Henan Norm. Uni. Nat. Sci. Ed., 41(4) (2013), 40-44.∗
[125] Min Li, The crossing numbers of the join of a 5-vertex graph with vertex, path and cycle,J. Yangzhou Uni. Nat. Sci. Ed., 18(1) (2015), 4-8.∗
[126] Xiaohui Lin, Yuansheng Yang, Jianguo L¨u and Xin Hao, The crossing number ofC(mk;1, k),Graphs Combin., 21(1) (2005), 89-96. · Zbl 1061.05027
[127] Xioahui Lin, Yuansheng Yang, Jianguo L¨u and Xin Hao, The Crossing Number ofC(n;1,[n/2]−1),Util. Math., 71 (2006), 245-255. · Zbl 1109.05035
[128] Xiaohui Lin, Yuansheng Yang, Wenping Zheng, Lei Shi and Weiming Lu, The crossing numbers of generalized Petersen graphs with small order,Disc. Appl. Math., 157(5) (2009), 1016-1023. · Zbl 1169.05316
[129] Wei Liu, Zihan Yuan and Shengxiang L¨u, The Crossing Number ofc(7,2) e1, e2 ×Pn,J. Hunan Inst. Sci. Tech., 25(1) (2012), 16-19.∗
[130] Bo L¨u, Xirong Xu, Yuansheng Yang, Ke Zhang and Baigong Zheng, Crossing number of Star graphS4,J. Dalian Uni. Tech., 54(4) (2014), 469-476. · Zbl 1324.05035
[131] Shengxiang L¨u and Yuanqiu Huang, The crossing number ofK5×Sn,J. Math. Res. Exp., 28(3) (2008), 445-459. · Zbl 1199.05071
[132] Shengxiang L¨u and Yuanqiu Huang, On the crossing number ofK2,4×Sn,J. Sys. Sci. Math. Sci., 30(7) (2010), 929-935.∗ · Zbl 1240.05062
[133] Shengxiang L¨u and Yuanqiu Huang, The crossing number ofK5\e×Sn,J. Hunan Uni. Art. Sci. Nat. Sci., 23(1) (2011), 1-5.∗
[134] Dengju Ma, The crossing number of the strong product of two paths,Austral. J. Combin., 68(1) (2017), 35-47. · Zbl 1375.05228
[135] Dengju Ma, Han Ren and Junjie Lu, Crossing Number of the Generalized Petersen GraphG(2m+ 1, m),J. East China Norm. Uni. (Nat. Sci. Ed.), 2005(1) (2005), 34-39. · Zbl 1077.05033
[136] Dengju Ma, Han Ren and Junjie Lu, The crossing number of the circular graph C(2m+ 2, m),Disc. Math., 304 (2005), 88-93. · Zbl 1077.05033
[137] Tom Madej, Bounds for the crossing number of theN-cube,J. Graph Th., 15(1) (1991), 81-97. · Zbl 0722.05028
[138] Paul D. Manuel, Bharati Rajan, Indra Rajasingh and P. Vasanthi Beula, Improved bounds on the crossing number of butterfly network,Disc. Math. Th. Comp. Sci., 15(2) (2013), 87-94. · Zbl 1282.68079
[139] Dan McQuillan, Shengjun Pan and R. Bruce Richter, On the crossing number ofK13,J. Combin. Th. Series B, 115 (2015), 224-235. · Zbl 1319.05045
[140] Dan McQuillan and R. Bruce Richter, On the crossing numbers of certain generalized Petersen graphs,Disc. Math., 104(3) (1992), 311-320. · Zbl 0756.05048
[141] Hanfei Mei and Yuanqiu Huang, The Crossing Number ofK1,5,n,Int. J. Math. Combin., 1(1) (2007), 33-44.∗ · Zbl 1140.05023
[142] Bernard Montaron, An Improvement of the Crossing Number Bound,J. Graph Th., 50(1) (2005), 43-54. · Zbl 1073.05020
[143] Nagi H. Nahas, On the Crossing Number ofKm,n,Elec. J. Combin., 10, Note 8, (2003). · Zbl 1023.05039
[144] Alex Newcombe,An efficient heuristic for crossing minimisation and its applications, PhD Thesis, Flinders University, (2019). · Zbl 1407.05220
[145] SergeyNorin,PresentationattheBIRSWorkshopongeometricandtopologicalgraphtheory(13w5091),October1,(2013). https://www.birs.ca/events/2013/5-day-workshops/13w5091/videos/ watch/201310011538-Norin.html. Accessed: 07-06-2020.
[146] Sabine R. Ohring, Maximilian Ibel, Sajal K. Das and Mohan J. Kumar, On generalized fat trees. In:Parallel Processing Symposium, 1995. Proceedings, 9th international, IEEE, (1995), pp. 37-44.
[147] Bogdan Oporowski and David Zhao, Coloring graphs with crossings,Disc. Math., 309(6) (2009), 2948-2951. · Zbl 1198.05068
[148] Zhangdong Ouyang, Jing Wang and Yuanqiu Huang, On the crossing number ofK1,1,m2Pn,Sci. Sinica Math., 44(12) (2014), 1337-1342.
[149] Zhangdong Ouyang, Jing Wang and Yuanqiu Huang, The crossing number of the Cartesian product of paths with complete graphs,Disc. Math., 328 (2014), 71-78. · Zbl 1288.05065
[150] Zhanhgdong Ouyang, Jing Wang and Yuanqiu Huang, The crossing number of join of the generalized Petersen graphP(3,1) with path and cycle,Disc. Math. Graph Th., 38(2) (2018), 351-370. · Zbl 1390.05051
[151] Zhangdong Ouyang, Jing Wang and Yuanqiu Huang, The Strong Product of Graphs and Crossing Numbers,Ars Combin., 137 (2018), 141-147. · Zbl 06890318
[152] J´anos Pach, Rados Radoiˇci´c, G´abor Tardos and G´eza T´oth, Improving the crossing lemma by finding more crossings in sparse graphs,Disc. Comp. Geom., 36(4) (2006), 527-552.
[153] J´anos Pach and G´eza T´oth, Graphs drawn with few crossings per edge,Combinatorica, 17(3) (1997), 427-439.
[154] Shengjun Pan and R. Bruce Richter, The crossing number ofK11is 100,J. Graph Th., 56(2) (2007), 128-134. · Zbl 1128.05018
[155] Jana Petrillov´a, On the optimal drawings of Cartesian products of special 6-vertex graphs with path,Math. Model. Geom., 3(3) (2015), 19-28.
[156] Benny Pinontoan and R. Bruce Richter, Crossing numbers and sequences of graphs I: general tiles,Austral. J. Combin., 30 (2004), 197-206. · Zbl 1053.05036
[157] Chunhua Qian,The crossing number of a 5-vertex graph and the star graph, Masters Thesis, Hunan Normal University, (2007).∗
[158] Chunhua Qian and Yuanqiu Huang, The Crossing Number of the Complete Quadruple Graph,J. Hunan Uni. Art. Sci. Nat. Sci. Ed., 19(4) (2007), 13-17. · Zbl 1150.05347
[159] Bharati Rajan, Indra Rajasingh and P. Vasanthi Beulah, On the crossing number of generalized fat trees, In:International Conference on Informatics Engineering and Information Science, Springer, Berlin, Heidelberg, (2011), pp. 440-448. · Zbl 1248.05050
[160] Bhatari Rajan, Indra Rajasingh and P. Vasanthi Beulah, Crossing Number of Join of Triangular Snake withmK1, Path and Cycle,Int. J. Comp. Appl., 44(17) (2012), 20-22. · Zbl 1271.68200
[161] R. Bruce Richter and Gelasio Salazar, The crossing number ofC6×Cn,Austral. J. Combin., 23 (2001), 135-143. · Zbl 0972.05015
[162] R. Bruce Richter and Gelasio Salazar, The crossing number of P(N,3),Graph. Combin., 18(2) (2002), 381-394. · Zbl 0999.05022
[163] R. Bruce Richter and Carsten Thomassen, Intersections of curve systems and the crossing number ofC5×C5,Disc. Comput. Geom., 13(1) (1995), 149-159.
[164] Richard D. Ringeisen and Lowell W. Beineke, The crossing number ofC3×Cn, J. Combin. Th. Series B, 24(2) (1978), 134-136. · Zbl 0383.05015
[165] Thomas L. Saaty, The minimum number of intersections in complete graphs, Proc. Nat. Acad. Sci. USA, 52 (1964), 688-690. · Zbl 0126.39301
[166] Gelasio Salazar,Crossing Numbers of Certain Families of Graphs, PhD Thesis, Carleton University, (1997). · Zbl 1021.05029
[167] Gelasio Salazar, A lower bound for the crossing number ofCm×Cn,J. Graph Th., 35(3) (2000), 222-226. · Zbl 0959.05063
[168] Gelasio Salazar, On the crossing numbers of loop networks and generalized Petersen graphs,Disc. Math., 302(1-3) (2005), 243-253. · Zbl 1080.05026
[169] Gelasio Salazar and Edgardo Ugalde, An Improved Bound for the Crossing Number ofCm×Cn: a Self-Contained Proof Using Mostly Combinatorial Arguments,Graphs Combin., 20 (2004), 247-253. · Zbl 1053.05037
[170] Marko L. Saraˇzin, The crossing number of the generalized Petersen graph P(10,4) is four,Math. Slovaca, 47(2) (1997), 189-192. · Zbl 1053.05507
[171] Marcus Schaefer, The graph crossing number and its variants: A survey,Elec. J. Combin., DS21 version 4, (2020). · Zbl 1267.05180
[172] Marcus Schaefer,Crossing numbers of graphs.CRC Press, (2018). · Zbl 1388.05005
[173] Farhad Shahrokhi, Ondrej S´ykora, L´aszl´o A. Sz´ekely and Imrich Vrt’o, Crossing Numbers of Meshes, In:International Symposium on Graph Drawing, Springer, Berlin, Heidelberg, (1995), pp. 463-471.
[174] Farhad Shahrokhi, Ondrej S´ykora, L´aszl´o A. Sz´ekely and Imrich Vrt’o, Intersection of Curves and Crossing Number ofCm×Cnon Surfaces,Disc. Comp. Geom., 19 (1998), 237-247.
[175] Natarajan Shanthini and Jayapal Baskar Babujee, Crossing Number forS4+ SN,Asian J. Res. Soc. Sci. Hum., 6(9) (2016), 2030-2041.∗
[176] Natarajan Shanthini and Jayapal Baskar Babujee, Crossing numbers for join of the tripartite graph withnK1and path,Int. J. Pure Appl. Math., 109(5) (2016), 13-22.∗
[177] Michal Staˇs, Cyclic permutations: crossing numbers of the join products of graphs, In:Proc. APLIMAT 2018: 17th Conf. Appl. Math. (Slovak University of Technology, Bratislava, 2018), (2018), pp. 979-987.
[178] Michal Staˇs, Determining crossing numbers of graphs of order six using cycle permutations,Bull. Austral. Math. Soc, 98 (2018), 353-362.
[179] Michal Staˇs, Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five,Symmetry, 11(2) (2019), 123.
[180] Michal Staˇs, Determining crossing number of one graph of order five using cyclic permutations, In:APLIMAT 2019: Proceedings of the 18th Conference on Applied Mathematics (Slovak University of Technology, Bratislava, 2019), (2019), pp. 1126-1133.
[181] Michal Staˇs and Jana Petrillov´a, On the join products of two special graphs on five vertices with the path and the cycle,Math. Model. Geom., 6(2) (2018), 1-11.
[182] Zhenhua Su, The Crossing Numbers of a 6-vertex GraphGProduct withSn, J. Math. Stud., 44(4) (2011), 411-416.∗
[183] Zhenhua Su, The Crossing Number of Cartesian Products of the Special Graph on Six Vertices with Stars,Math. Prac. Th., 47(12) (2017), 182-188.∗ · Zbl 1389.05143
[184] Zhenhua Su, The crossing number of the join product ofC6+ 3K2withPn andCn,Oper. Res. Trans., 21(3) (2017), 23-34. · Zbl 1399.05054
[185] Zhenhua Su, The Crossing Number of the Join Product ofK1,1,1,2+PnActa Math. Appl. Sinica, 40(3) (2017), 345-354. · Zbl 1399.05052
[186] Zhenhua Su, The Crossing Numbers of the Join of a 6-vertex GraphsHwith PnandCn,J. Shanxi Norm. Uni., 31(3) (2017), 14-19.∗
[187] Zhenhua Su, Crossing numbers of join products ofK1,1,3∨Cn,Comp. Eng. Appl., 54(9) (2018), 57-61.
[188] Zhenhua Su, The crossing numbers ofK5+Pn,J. Math. Res. App., 38(4) (2018), 331-340. · Zbl 1424.05062
[189] Zhenhua Su and Yuanqiu Huang, Crossing Numbers of Some Classes of Cartesian Product Graphic,J. Jishou Uni. Nat. Sci. Ed., 29(6) (2008), 25-28.∗
[190] Zhenhua Su and Yuanqiu Huang, Crossing Number ofK2,3∨Pn,Appl. Math. China Ser. A, 27(4) (2012), 488-492. · Zbl 1289.05339
[191] Zhenhua Su and Yuanqiu Huang, Crossing Numbers ofP62+e ×Sn,J. Jishou Uni. Nat. Sci. Ed., 33(4) (2012), 20-24.∗
[192] Zhenhua Su and Yuanqiu Huang, The Crossing Number ofWm∨Pn,J. Math. Stud., 45(3) (2012), 310-314.∗
[193] Zhenhua Su and Yuanqiu Huang, The Crossing Number ofS5∨Cn,J. Math. Stud., 46(4) (2013), 413-417.∗
[194] Zhenhua Su and Yuanqiu Huang, Crossing Number of join of three 5-vertex graphs withPn,App. Math. China, 29(2) (2014), 245-252. · Zbl 1313.05072
[195] Ondrej S´ykora and Imrich Vrt’o, On crossing numbers of hypercubes and cube connected cycles,BIT Num. Math., 33(2) (1993), 232-237.
[196] Ling Tang, Shengxiang L¨u and Yuanqiu Huang, The Crossing Number of Cartesian Products of Complete Bipartite GraphsK2,mwith PathsPn,Graphs Combin., 23 (2007), 659-666. · Zbl 1141.05030
[197] N. Vijaya, Bharati Rajan and Ibrahim Venkat, Crossing numbers of join of a graph on six vertices with a path and a cycle,Int. J. Advance. Soft. Comp. Appl., 8(2) (2016), 41-51.∗
[198] Imrich Vrt’o, Bibliography on crossing numbers, ftp://ftp.ifi.savba.sk/pub/ imrich/crobib.pdf, (2014).
[199] Guoqing Wang, Haoli Wang, Yuansheng Yang, Xuezhi Yang and Wenping Zheng, An upper bound for the crossing number of augmented cubes,Int. J. Comp. Math., 90(2) (2013), 183-227. · Zbl 1281.68167
[200] Haoli Wang, Xirong Xu, Yuansheng Yang, Bao Liu, Wenping Zheng and Guoqing Wang, An upper bound for the crossing number of locally twisted cubes, Ars. Comb., 131 (2017), 87-106. · Zbl 1424.05215
[201] Haoli Wang, Yuansheng Yang, Yan Zhou, Wenping Zheng and Guoqing Wang, The crossing number of folded hypercubes,Util. Math., 98 (2015), 393-408. · Zbl 1343.05110
[202] Jing Wang and Yuanqiu Huang, The Crossing Numbers of Cartesian Products of Paths with 6-Vertex Graphs,J. Jishou Uni. Nat. Sci. Ed., 26(2) (2005), 9-13.∗
[203] Jing Wang and Yuanqiu Huang, Crossing number of the complete tripartite graphK1,10,n,Appl. Math. China Ser. A., 23(3) (2008), 349-356. · Zbl 1174.05047
[204] Jing Wang and Yuanqiu Huang, The crossing number ofK2,4×Pn,Acta Math. Sci., Ser. A., Chin. Ed., 28 (2008), 251-255.∗ · Zbl 1164.05016
[205] Jing Wang and Yuanqiu Huang, The Crossing Number of the Circulant Graph C(3k−1;1, k),Int. J. Math. Combin., 3 (2008), 79-84.∗ · Zbl 1202.05031
[206] Jing Wang, Zhangdon Ouyang and Yuanqiu Huang, The Crossing Number of the Hexagonal GraphH3,n,Disc. Math. Graph Th., 39 (2019), 547-554. · Zbl 1404.05038
[207] Jing Wang, Lixi Zhang and Yuanqiu Huang, On the Crossing Number of the Cartesian Product of a 6-Vertex Graph withSn,Ars Combin., 109 (2013), 257-266. · Zbl 1289.05405
[208] Junshuai Wang and Dengju Ma, The Crossing Number ofV8×Pn,J. Nantong Uni. Nat. Sci, 16(3) (2017), 79-85.∗
[209] Yuxi Wang and Yianqui Huang, The Crossing Number of Cartesian Product of 5-Wheel with any Tree,Disc. Math. Graph Th., to appear.
[210] Mark E. Watkins, A Theorem on Tait Colorings with an Application to the Generalized Petersen Graphs,J. Combin. Th., 6 (1969), 152-164. · Zbl 0175.50303
[211] Wynand Winterbach,The crossing number of a graph in the plane, Master’s Thesis, University of Stellenbosch, (2005).
[212] Douglas R. Woodall, Cyclic-order graphs and Zarankiewicz’s crossing-number conjecture,J. Graph Th., 17(6) (1993), 657-671. · Zbl 0792.05142
[213] Wenbing Xiao and Yuanqiu Huang, The Crossing Numbers of Some Classes of Cartesian Product Graphic,J. Nat. Sci. Hunan Norm. Uni., 26(4) (2003), 3-7.∗ · Zbl 1043.05503
[214] Wenbing Xiao, Hongzhuan Wang and Yuanqiu Huang, The Crossing Number of StarSnCartesian Product and 6 Vevtex Graph,J. Hunan Uni. Arts Sci. Nat. Sci. Ed., 16(4) (2004), 15-17.∗ · Zbl 1090.05502
[215] Xiaofan Yang, David J. Evans and Graham M. Megson, The locally twisted cubes,Int. J. Comput. Math., 82 (2005), 401-413. · Zbl 1097.68522
[216] Xiwu Yang,The Crossing Number of Flower Snark andKm−2Pn, Masters Thesis, Dalian University of Technology, (2007).∗
[217] Yuansheng Yang, Xiaohui Lin, Jianguo Lu and Xin Hao, The crossing number ofC(n;1, 3),Disc. Math., 289(1-3) (2004), 107-118. · Zbl 1056.05043
[218] Yuansheng Yang, Bo Lv, Baigong Zheng, Xirong Xu and Ke Zhang, The crossing number of pancake graphP4is six,Ars Combin., 131 (2017), 43-53. · Zbl 1424.05216
[219] Yuansheng Yang, Guoqing Wang, Haoli Wang and Yan Zhou,The Erd˝os and Guy’s conjectured equality on the crossing number of hypercubes, arXiv:1201.4700, submitted 2017.
[220] Yuansheng Yang and Chengye Zhao, The crossing number ofCn(1, k),National symposium on software technology held by Chinese Computer Institute 2001, (2001), 134-136.∗
[221] Xiuhua Yuan, On the crossing numbers ofK2,3∨Cn,J. East China Norm. Uni. Nat. Sci., 2011(5) (2011), 21-24.
[222] Zihan Yuan and Yuanqiu Huang, Crossing Number ofCm+e1andCm+ e1+e2withPn,J. Jishou Uni. Nat. Sci. Ed., 28(3) (2007), 16-18.∗
[223] Zihan Yuan and Yuanqiu Huang, The Crossing Number of Cartesian Product of a 3-connected Graph with Six Vertices and a Path,Math. Th. Appl., 27(2) (2007), 49-51.∗
[224] Zihan Yuan and Yuanqiu Huang, Crossing numbers ofK(1,1,2,2)×Pn,Appl. Math. China Ser. A, 25(1) (2010), 75-84. · Zbl 1224.05124
[225] Zihan Yuan and Yuanqiu Huang, The Crossing Number ofC(12,2)×Pn,Adv. Math. China, 40(5) (2011), 587-594.
[226] Zihan Yuan and Yuanqiu Huang, The Crossing Number of Petersen Graph P(4,1) with PathsPn,Oper. Res. Trans., 15(3) (2011), 95-106.∗ · Zbl 1249.05083
[227] Zihan Yuan and Yuanqiu Huang and Jinwang Liu, The crossing number of C(7,2)×Pn,Adv. Math. China, 37(2) (2008), 245-253.∗
[228] Zihan Yuan, Yuanqiu Huang and Jinwang Liu, The Crossing Number of Cartesian Product of Circulant Graph (9,2) with PathPn,Acta Math. Appl. Sinica, 36(2) (2013), 350-362. · Zbl 1289.05110
[229] Zihan Yuan, Tang Lien, Yuanqiu Huang and Jinwang Liu, The Crossing Number ofC(8,2)2Pn,Graphs Combin., 24(6) (2008), 597-604. · Zbl 1167.05021
[230] Zihan Yuan, Jing Wang and Yuanqiu Huang, The Crossing Number of Cartesian Product ofPnwith Circulant GraphC(10,2),Acta Math. Appl. Sinica, 32(6) (2009), 1133-1144. · Zbl 1212.05060
[231] Weijun Yue, Yuanqiu Huang and Zhangdong Ouyang, On crossing numbers of join ofW4+Cn.Comp. Eng. Appl., 50(18) (2014), 79-84.
[232] Weijun Yue, Yuanqiu Huang and Ling Tang, The crossing number of join products of three 6-vertex graphs withCn,J. Hunan Uni. Arts Sci. Nat. Sci. Ed., 25(4) (2013), 1-7.∗
[233] Kazimierz Zarankiewicz, On a problem of P. Turan concerning graphs,Fund. Math., 41(1) (1955), 137-145. · Zbl 0055.41605
[234] Lixi Zhang and Yuanqiu Huang, On the crossing number of Cartesian products of a 5-vertex graphG7with star,J. Hunan Uni. Arts Sci. Nat. Sci. Ed., 23(4) (2011), 3-6.∗
[235] Lixi Zhang, Bo Li and Yuanqiu Huang, Crossing Number of the Cartesian Product of a 6-Vertex Graph withSn,J. Jishou Uni. Nat. Sci. Ed., 29(5) (2008), 23-29.∗ · Zbl 1174.05345
[236] Lixi Zhang, Bo Li and Yuanqiu Huang, On the crossing number of products of a graph of order 6 and the star,J. Hunan Uni. Arts Sci. Nat. Sci. Ed., 20(1) (2008), 16-19.∗ · Zbl 1174.05348
[237] Yulan Zhang, The Crossing Numbers ofS4∨Cn,J. Gansu Lianhe Uni. Nat. Sci. Ed, 27(2) (2013), 31-34.∗
[238] Dunyoung Zheng and Yuanqiu Huang, Crossing Number of the Join Graph of a 5-Vertex Graph and Path,J. Shantou Uni. Nat. Sci. Ed., 26(4) (2011), 11-17.∗
[239] Wenping Zheng, Xiaohui Lin, Yuansheng Yang and Chong Cui, On the crossing number ofKm2Pn,Graphs Combin., 23(3) (2007), 327-336. · Zbl 1122.05031
[240] Wenping Zheng, Xiaohui Lin, Yuansheng Yang and Chengrui Deng, On the crossing number ofKm2CnandKm,l2Pn,Disc. Appl. Math., 156 (2008), 1892-1907. · Zbl 1161.05030
[241] Wenping Zheng, Xiaohui Lin, Yuansheng Yang and Chengrui Deng, The Crossing Number of Kn¨odel GraphW3,n,Util. Math., 75 (2008), 211-224. · Zbl 1161.05029
[242] Wenping Zheng, Xiaohui Lin, Yuansheng Yang and Yang Gui, On the Crossing Numbers of thek-th Power ofPn,Ars Combin., 92 (2009), 397-409. · Zbl 1224.05126
[243] Wenping Zheng, Xiaohui Lin, Yuansheng Yang and Xiwu Yang, The crossing number of flower snarks and related graphs,Ars Combin., 86 (2008), 57-64. · Zbl 1224.05127
[244] Wenping Zheng, Xiaohui Lin, Yuansheng Yang and Xiwu Yang, The Crossing Numbers of Cartesian Product of Cone GraphCm+Klwith PathPn,Ars Combin., 98 (2011), 433-445. · Zbl 1249.05271
[245] Zhidong Zhou and Yuanqiu Huang, The Crossing Number ofK3,3×Pn,J. Hunan Norm. Uni. Nat. Sci., 30(1) (2007), 31-34.∗ · Zbl 1155.05320
[246] Zhidong Zhou, Yuanqiu Huang, Xiaoduo Peng and Juan Ouyang, The Crossing Number of the Joint Graph of a Small Graph and a Path or a Cycle,J. Sys. Sci. Math. Sci., 33(2) (2013), 206-216. · Zbl 1289.05111
[247] Zhidong Zhou and Long Li, On the crossing number of the joint graph,J. Shaoyang Uni. Nat. Sci. Ed., 13(3) (2016), 16-24.∗
[248] Zhidong Zhou and Long Li, On the crossing numbers of the joins of the special graph on six vertices withnK1,PnorCn,Oper. Res. Trans., 20(4) (2016), 115-126. · Zbl 1374.05075
[249] Zhidong Zhou and Long Li, On the Crossing Number of Join Product of Path and a Graph of Order Six,Math. · Zbl 1389.05145
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.