References

  1. Berežný Š., Staš M. On the crossing number of join of the wheel on six vertices with the discrete graph. Carpathian J. Math. 2020, 36 (3), 381–390. doi:10.37193/CJM.2020.03.06
  2. Berežný Š., Staš M. On the crossing number of the join of the wheel on six vertices with a path. Carpathian J. Math. 2022, 38 (2), 337–346. doi:10.37193/CJM.2022.02.06
  3. Clancy K., Haythorpe M., Newcombe A. A survey of graphs with known or bounded crossing numbers. Australas. J. Combin. 2020, 78 (2), 209–296.
  4. Garey M.R., Johnson D.S. Crossing number is NP-complete. SIAM J. Matrix Anal. Appl. 1983, 4 (3), 312–316. doi:10.1137/0604033
  5. Hernández-Vélez C., Medina C., Salazar G. The optimal drawing of \(K_{5,n}\). Electron. J. Combin. 2014, 21 (4), article P4.1. doi:10.37236/2777
  6. Kleitman D.J. The crossing number of \(K_{5,n}\). J. Combin. Theory Ser. A 1970, 9, 315–323. doi:10.1016/S0021-9800(70)80087-4
  7. Klešč M. The crossing number of join of the special graph on six vertices with path and cycle. Discrete Math. 2010, 310 (9), 1475–1481. doi:10.1016/j.disc.2009.08.018
  8. Klešč M. The join of graphs and crossing numbers. Electron. Notes Discrete Math. 2007, 28, 349–355. doi:10.1016/j.endm.2007.01.049
  9. Klešč M. The crossing numbers of join of cycles with graphs of order four. In: Proc. of Aplimat 2019, \(18^{th}\) Conference on Applied Mathematics, 634–641.
  10. Klešč M., Kravecová D., Petrillová J. The crossing numbers of join of special graphs. Electrical Engineering and Informatics 2: Proc. of Faculty of Electrical Engineering and Informatics of Technical University of Košice 2011, 522–527.
  11. Klešč M., Petrillová J., Valo M. On the crossing numbers of Cartesian products of wheels and trees. Discuss. Math. Graph Theory 2017, 37 (2), 339–413. doi:10.7151/dmgt.1957
  12. Klešč M., Schrötter Š. The crossing numbers of join of paths and cycles with two graphs of order five. In: Adam G., Buša J., Hnatič M. (Eds.) Mathematical Modeling and Computational Science. MMCP 2011. Lecture Notes in Computer Science, 7125. Springer, Berlin, Heidelberg. doi:10.1007/978-3-642-28212-6_15
  13. Klešč M., Staš M. Cyclic permutations in determining crossing numbers. Discuss. Math. Graph Theory 2022, 42, 1163–1183. doi:10.7151/dmgt.2351
  14. Klešč M., Valo M. Minimum crossings in join of graphs with paths and cycles. Acta Electrotechnica et Informatica 2012, 12 (3), 32–37. doi:10.2478/v10198-012-0028-0
  15. Li L. The Crossing numbers of join of a 5-Vertex graph with path and cycle. Math. Pract. Theory 2014, 44 (11), 203–211.
  16. Ouyang Z., Wang J., Huang Y. The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle. Discuss. Math. Graph Theory 2018, 38, 351–370. doi:10.7151/dmgt.2005
  17. Staš M. The crossing numbers of join products of paths and cycles with four graphs of order five. Mathematics 2021, 9 (11), 1277. doi:10.3390/math9111277
  18. Staš M. On the crossing numbers of the join products of six graphs of order six with paths and cycles. Symmetry 2021, 13 (12), 2441. doi:10.3390/sym13122441
  19. Staš M. The crossing numbers of join products of eight graphs of order six with paths and cycles. Carpathian Math. Publ. 2023, 15 (1), 66–77. doi:10.15330/cmp.15.1.66-77
  20. Staš M., Valiska J. On the crossing numbers of join products of \(W_4+P_n\) and \(W_4+C_n\). Opuscula Math. 2021, 41 (1), 95–112. doi:10.7494/OpMath.2021.41.1.95
  21. Staš M., Timková M. The crossing numbers of join products of four graphs of order five with paths and cycles. Opuscula Math. 2023, 43 (6), 865–883. doi:10.7494/OpMath.2023.43.6.865
  22. Wang Y., Huang Y.Q. The crossing number of Cartesian product of 5-wheel with any tree. Discuss. Math. Graph Theory 2021, 41, 183–197. doi:10.7151/dmgt.2181
  23. Yang X., Wang Y. The conjecture on the crossing number of \(K_{1,m,n}\) is true if Zarankiewicz’s conjecture holds. Graphs Combin. 2021, 37 (3), 1083–1088. doi:10.1007/s00373-021-02303-y
  24. Yue W., Huang Y., Ouyang Z. On crossing numbers of join of \(W_4+ C_n\). Comp. Eng. Appl. 2014, 50 (18), 79–84.
  25. Woodall D.R. Cyclic-order graphs and Zarankiewicz’s crossing number conjecture. J. Graph Theory 1993, 17, 657–671.