Results 41 to 50 of about 307,259 (304)
Note on the Pair-crossing Number and the Odd-crossing Number [PDF]
Discrete & Computational Geometry, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Characterization of semientire graphs with crossing number 2 [PDF]
, 2002 summary:The purpose of this paper is to give characterizations of graphs whose vertex-semientire graphs and edge-semientire graphs have crossing number 2.
Bano, J. K., Akka, D. G.
core +1 more source
On the Crossing Numbers of Cartesian Products of Wheels and Trees
Discussiones Mathematicae Graph Theory, 2017 Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián +2 more
doaj +1 more source
On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six
Discussiones Mathematicae Graph Theory, 2013 The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of ...
Klešč Marián, Schrötter Štefan
doaj +1 more source
On the Maximum Crossing Number
Journal of Graph Algorithms and Applications, 2018 Research about crossings is typically about minimization. In this paper, we consider maximizing the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured that any graph has a convex straight-line drawing, that is, a drawing with vertices in convex position ...
Markus Chimani +5 more
openaire +4 more sources
Crossing Numbers of Join Product with Discrete Graphs: A Study on 6-Vertex Graphs
Mathematics, 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.
Jana Fortes, Michal Staš
doaj +1 more source
On the crossing numbers of join products of five graphs of order six with the discrete graph [PDF]
Opuscula Mathematica, 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 of ...
Michal Staš
doaj +1 more source
ON THE CROSSING NUMBER OF THE JOIN OF FIVE VERTEX GRAPH WITH THE DISCRETE GRAPH Dn [PDF]
Acta Electrotechnica et Informatica, 2017 In this paper, we show the values of crossing numbers for join products of graph G on five vertices with the discrete graph Dn and the path Pn on n vertices. The proof is done with the help of software. The software generates all cyclic permutations for
Štefan BEREŽNÝ, Michal STAŠ
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2005 An edge in a drawing of a graph is called $\textit{even}$ if it intersects every other edge of the graph an even number of times. Pach and Tóth proved that a graph can always be redrawn such that its even edges are not involved in any intersections.
Michael J. Pelsmajer +2 more
doaj +1 more source
Mathematics, 2020 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 goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete ...
Michal Staš
doaj +1 more source