Michal Stas

Orcid: 0000-0002-2837-8879

According to our database1, Michal Stas authored at least 11 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
From the Crossing Numbers of K5 + Pn and K5 + Cn to the Crossing Numbers of Wm + Sn and Wm + Wn.
Axioms, July, 2024

2023
Disconnected spanning subgraphs of paths in the join products with cycles.
Art Discret. Appl. Math., February, 2023

Calculating Crossing Numbers of Graphs Using Their Redrawings.
Symmetry, 2023

On the problems of CF-connected graphs.
Electron. J. Graph Theory Appl., 2023

2022
The Crossing Numbers of Join of Special Disconnected Graph on Five Vertices with Discrete Graphs.
Graphs Comb., 2022

Cyclic permutations in determining crossing numbers.
Discuss. Math. Graph Theory, 2022

2021
On the Crossing Numbers of the Join Products of Six Graphs of Order Six with Paths and Cycles.
Symmetry, 2021

2020
On the Crossing Numbers of the Joining of a Specific Graph on Six Vertices with the Discrete Graph.
Symmetry, 2020

On the crossing number of join product of the discrete graph with special graphs of order five.
Electron. J. Graph Theory Appl., 2020

2019
Determining Crossing Number of Join of the Discrete Graph with Two Symmetric Graphs of Order Five.
Symmetry, 2019

A Study on Effectiveness of Processing in Computational Clouds Considering Its Cost.
Proceedings of the Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology - ISAT 2019, 2019


  Loading...