Results 1 to 10 of about 274,665 (211)
The crossing number of the generalized Petersen graph P(3k,k) in the projective plane [PDF]
AKCE International Journal of Graphs and Combinatorics, 2023 The crossing number of a graph G in a surface Σ, denoted by [Formula: see text], is the minimum number of pairwise intersections of edges in a drawing of G in Σ. Let k be an integer satisfying [Formula: see text], the generalized Petersen graph [Formula:
Jing Wang, Zuozheng Zhang
doaj +2 more sources
Cubicity, Degeneracy, and Crossing Number [PDF]
European Journal of Combinatorics, 2011 21 ...
Abhijin Adiga +2 more
+7 more sources
Approximating the rectilinear crossing number [PDF]
Computational Geometry, 2016 A straight-line drawing of a graph $G$ is a mapping which assigns to each vertex a point in the plane and to each edge a straight-line segment connecting the corresponding two points. The rectilinear crossing number of a graph $G$, $\overline{cr}(G)$, is the minimum number of crossing edges in any straight-line drawing of $G$. Determining or estimating
Jacob Fox, János Pach, Andrew Suk
openalex +6 more sources
The Bundled Crossing Number [PDF]
, 2016 Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016)
Md. Jawaherul Alam +2 more
openalex +5 more sources
On the crossing number of join product of the discrete graph with special graphs of order five [PDF]
Electronic Journal of Graph Theory and Applications, 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.
Michal Staš
doaj +2 more sources
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.
Gézá Tóth
openalex +4 more sources
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 +2 more sources
Crossing lemma for the odd-crossing number
Computational Geometry, 2022 A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be drawn in the plane such that every edge is crossed by at most one other edge {\em an odd number of times}, then it ...
János Karl, Gézá Tóth
openalex +5 more sources
Counting Hamiltonian Cycles in 2-Tiled Graphs
Mathematics, 2021 In 1930, Kuratowski showed that K3,3 and K5 are the only two minor-minimal nonplanar graphs. Robertson and Seymour extended finiteness of the set of forbidden minors for any surface.
Alen Vegi Kalamar +2 more
doaj +1 more source
Minor-monotone crossing number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The minor crossing number of a graph $G$, $rmmcr(G)$, is defined as the minimum crossing number of all graphs that contain $G$ as a minor. We present some basic properties of this new minor-monotone graph invariant.
Drago Bokal +2 more
doaj +1 more source