Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Michal Staš"'
Autor:
Michal Staš, Mária Timková
Publikováno v:
Mathematics, Vol 12, Iss 22, p 3484 (2024)
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by
Externí odkaz:
https://doaj.org/article/bd5c19a8c56b4e6d9e57fdc6d67b632d
Autor:
Michal Staš, Mária Timková
Publikováno v:
Opuscula Mathematica, Vol 43, Iss 6, Pp 865-883 (2023)
The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. In the paper, we extend known results concerning crossing numbers of join products of four small graphs with path
Externí odkaz:
https://doaj.org/article/258c4dad4745482287c531790b8bf07d
Autor:
Michal Staš, Mária Timková
Publikováno v:
Mathematics, Vol 12, Iss 13, p 2068 (2024)
A connected graph, G, is Crossing Free-connected (CF-connected) if there is a path between every pair of vertices with no crossing on its edges for each optimal drawing of G. We conjecture that a complete tripartite graph, Kl,m,n, is CF-connected if
Externí odkaz:
https://doaj.org/article/7e15bec885ad4dd4a7968f396dcbe3b8
Publikováno v:
Axioms, Vol 13, Iss 7, p 427 (2024)
The crossing number of a graph is a significant measure that indicates the complexity of the graph and the difficulty of visualizing it. In this paper, we examine the crossing numbers of join products involving the complete graph K5 with discrete gra
Externí odkaz:
https://doaj.org/article/14a5de67422b4f41a91ba775461348e3
Autor:
Michal Staš, Mária Švecová
Publikováno v:
Opuscula Mathematica, Vol 42, Iss 4, Pp 635-651 (2022)
The main aim of this paper is to give the crossing number of the join product \(G^\ast+P_n\) for the disconnected graph \(G^\ast\) of order five consisting of the complete graph \(K_4\) and one isolated vertex, where \(P_n\) is the path on \(n\) vert
Externí odkaz:
https://doaj.org/article/1d9e862beccf404d9bbfae9504c81a02
Autor:
Jana Fortes, Michal Staš
Publikováno v:
Mathematics, Vol 11, Iss 13, p 2960 (2023)
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 pr
Externí odkaz:
https://doaj.org/article/fcb98b811d4945a582d972607856400b
Autor:
Michal Staš, Juraj Valiska
Publikováno v:
Opuscula Mathematica, Vol 41, Iss 1, Pp 95-112 (2021)
The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the
Externí odkaz:
https://doaj.org/article/a458dc4cf220491fa4f9a9f0b2e85a67
Autor:
Michal Staš
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2, Pp 339-351 (2020)
The main aim of the paper is to give the crossing number of join product G+Dn for the disconnected graph G of order five consisting of the complete graph K4 and of one isolated vertex. In the proofs, it will be extend the idea of the minimum numbers
Externí odkaz:
https://doaj.org/article/2795b4cbf6ae458385ce81e4902fe617
Autor:
Michal Staš
Publikováno v:
Opuscula Mathematica, Vol 40, Iss 3, Pp 383-397 (2020)
The main purpose of this article is broaden known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product \(G^{\ast} + D_n\), where the disconnected graph \(G^{\ast}\) of order six consists
Externí odkaz:
https://doaj.org/article/ff8218d5388f433ea15f17bf84e6e093
Autor:
Michal Staš
Publikováno v:
Symmetry, Vol 15, Iss 1, p 175 (2023)
The main aim of the paper is to give the crossing number of the join product G*+Dn. The connected graph G* of order six is isomorphic to K3,3\e obtained by removing one edge from the complete bipartite graph K3,3, and the discrete graph Dn consists o
Externí odkaz:
https://doaj.org/article/d1ebc2debb824465a260e9b712db70b7