Michal Staš

Country flagSlovakia

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Articles (13)

Year:

2026

Year:

2026

Year:

2025

Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory. This paper aims to determine the crossing number of the join product G*+Dn, where G* is a connected graph isomorphic to K2,2,2∖{e1,e2} obtained by removing two edges e1,e2 with a common vertex and a second vertex from the different partitions of the complete tripartite graph K2,2,2, and Dn is a discrete graph composed of n isolated vertices. The proofs utilize known exact crossing number values for join products of specific subgraphs Hk of G* with discrete graphs in combination with the separating cycles. Similar approaches can potentially estimate unknown crossing numbers of other six-vertex graphs with a larger number of edges in join products with discrete graphs, paths or cycles.

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2021