References

  1. Berežný Š., Staš M. Cyclic permutations and crossing numbers of join products of symmetric graph of order six. Carpathian J. Math. 2018, 34 (2), 143–155. doi:10.37193/CJM.2018.02.03
  2. Berežný Š., Staš M. Cyclic permutations and crossing numbers of join products of two symmetric graphs of order six. Carpathian J. Math. 2019, 35 (2), 137–146. doi:10.37193/CJM.2019.02.02
  3. 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
  4. Clancy K., Haythorpe M., Newcombe A. A survey of graphs with known or bounded crossing numbers. Australas. J. Combin. 2020, 78 (2), 209–296. doi:10.48550/arXiv.1901.05155
  5. Draženská E. On the crossing number of join of graph of order six with path. Proc. CJS 2019: \(22^{th}\) Czech-Japan Seminar on Data Analysis and Decision Making 2019, 41–48.
  6. Draženská E. Crossing numbers of join product of several graphs on 6 vertices with path using cyclic permutation. Proc. MME 2019: Proceedings of the \(37^{th}\) international conference 2019, 457–463.
  7. Garey M.R., Johnson D.S. Crossing number is NP-complete. SIAM J. Alg. Disc. Meth. 1983, 4 (3), 312–316.
  8. Kleitman D.J. The crossing number of \(K_{5,n}\). J. Combin. Theory 1971, 9, 315–323.
  9. 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
  10. 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
  11. Klešč M. The crossing numbers of join of cycles with graphs of order four. Proc. Aplimat 2019: \(18^{th}\) Conference on Applied Mathematics 2019, 634–641.
  12. Klešč M., Kravecová D., Petrillová J. The crossing numbers of join of special graphs. Electrical Engineering and Informatics 2: Proceeding of the Faculty of Electrical Engineering and Informatics of the Technical University of Košice 2011, 522–527.
  13. Klešč M., Petrillová J., Valo M. On the crossing numbers of Cartesian products of wheels and trees. Discuss. Math. Graph Theory 2017, 37 (2), 399–413. doi:10.7151/dmgt.1957
  14. Klešč M., Schrötter Š. The crossing numbers of join products of paths with graphs of order four. Discuss. Math. Graph Theory 2011, 31 (2), 321–331.
  15. Klešč M., Schrötter Š. The crossing numbers of join of paths and cycles with two graphs of order five. Combinatorial Algorithms, Springer, LNCS 2012, 7125, 160–167.
  16. Klešč M., Staš M. Cyclic permutations in determining crossing numbers. Discuss. Math. Graph Theory 2020, 42 (4), 1163–1183. doi:10.7151/dmgt.2351
  17. 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
  18. 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 (2), 351–370. doi:10.7151/dmgt.2005
  19. Staš M. Join Products \(K_{2,3} +C_n\). Mathematics 2020, 8 (6), 925. doi:10.3390/math8060925
  20. 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
  21. Staš M. On the crossing numbers of join products of five graphs of order six with the discrete graph. Opuscula Math. 2020, 40 (3), 383–397. doi:10.7494/OpMath.2020.40.3.383
  22. Staš M. Determining crossing number of join of the discrete graph with two symmetric graphs of order five. Symmetry 2019, 11 (2), 123. doi:10.3390/sym11020123
  23. Staš M., Petrillová J. On the join products of two special graphs on five vertices with the path and the cycle. Math. Model. and Geometry 2018, 6 (2), 1–11. doi:10.26456/mmg/2018-621
  24. 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
  25. Zhou Z., Huang Y., Peng X., Ouyang J. The Crossing Number of the Joint Graph of a Small Graph and a Path or a Cycle. J. Systems Sci. Math. Sci. 2013, 33 (2), 206–216. doi:10.12341/jssms12040
  26. Zhou Z., Li L. On the crossing numbers of the joins of the special graph on six vertices with \(nK_1\), \(P_n\) or \(C_n\). Oper. Res. Trans. 2016, 20 (4), 115–126. doi:10.15960/j.cnki.issn.1007-6093.2016.04.014