RNDr. Michal Staš, PhD.
Kontaktné informácie
michal.stas@tuke.sk | N32 619 |
+421 55 602 3249 | Odkaz na web |
Konzultácie
Utorok | 13.30 - 15.00 (alebo po dohode) |
E-mail
michal.stas@tuke.sk
|
Miestnosť
N32 619
|
Telefón
+421 55 602 3249
|
Konzultácie deň
Utorok
|
Konzultácie čas
13.30 - 15.00 (alebo po dohode)
|
Prednášam
M. Staš, Parity Properties of Configurations, Mathematics, 10(12) (2022), 1998.
M. Staš and M. Švecová, The crossing numbers of join products of paths with three graphs of order five, Opuscula Math., 42(4) (2022), 635-651.
M. Klešč and M. Staš, Cyclic permutations in determining crossing numbers, Discuss. Math. Graph Theory, 42(4) (2022), 1163-1183.
M. Klešč, M. Staš and J. Petrillová, The crossing numbers of join of special disconnected graph on five vertices with discrete graphs, Graphs and Combinatorics, 38(2) (2022), 35.
Š. Berežný and M. Staš, On the crossing number of the join of the wheel on six vertices with a path, Carpathian J. Math., 38(2) (2022), 337-346.
M. Staš, On the Crossing Numbers of Join Products of Four Graphs of Order Six With the Discrete Graph, Azerbaijan Journal of Mathematics, 12(1) (2022), 80-97.
M. Staš, On the Crossing Numbers of the Join Products of Six Graphs of Order Six with Paths and Cycles, Symmetry, 13(12) (2021), 2441.
M. Staš and J. Valiska, On the crossing numbers of join products of W4 + Pn and W4 + Cn, Opuscula Math., 41(1) (2021), 95-112.
M. Staš, The crossing numbers of join products of paths and cycles with four graphs of order five, Mathematics 9(11) (2021), 1277.
M. Staš and J. Valiska, On problems of CF-connected graphs for Km,n, Bull. Aust. Math. Soc. 104(2) (2021), 203–210.
Š. Berežný and M. Staš, On the crossing number of join of the wheel on six vertices with the discrete graph, Carpathian J. Math., 36(3) (2020), 381-390.
M. Staš, On the crossing numbers of join products of five graphs of order six with the discrete graph, Opusc. Math., 40(3) (2020), 383-397.
M. Staš, On the crossing number of join of the wheel on five vertices with the discrete graph, Bull. Aust. Math. Soc., 101(3) (2020), 353-361.
M. Staš, Determining Crossing Numbers of the Join Products of Two Specific Graphs of Order Six With the Discrete Graph, Filomat, 34(9) (2020), 2829-2846.
M. Staš, On the crossing number of join product of the discrete graph with special graphs of order five, Electron. J. Graph Theory Appl., 8(2) (2020), 339–351.
M. Staš, On the crossing numbers of the joining of a specific graph on six vertices with the discrete graph, Symmetry 12(1) (2020), 135.
M. Staš, Join Products K2,3 + Cn, Mathematics 8(6) (2020), 925.
Š. Berežný and M. Staš, Cyclic permutations and crossing numbers of join products of two symmetric graphs of order six, Carpathian J. Math., 35(2) (2019), 137-146.
Š. Berežný and M. Staš, Cyclic permutations and crossing numbers of join products of symmetric graph of order six, Carpathian J. Math., 34(2) (2018), 143-155.
M. Staš and J. Petrillová, On the join products of two special graphs on five vertices with the path and the cycle, J. Math. Model. and Geometry, 6(2) (2018), 1-11.
M. Staš, Determining crossing numbers of graphs of order six using cyclic permutations, Bull. Aust. Math. Soc., 98(3) (2018), 353–362.