Results 21 to 30 of about 307,259 (304)
Analogies between the Crossing Number and the Tangle Crossing Number [PDF]
The Electronic Journal of Combinatorics, 2018 Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of use in phylogenetics and are represented with straight-line drawings where the leaves of the two plane binary trees are on two parallel lines and only the matching edges can ...
Robin Anderson +10 more
openaire +4 more sources
On the Degenerate Crossing Number [PDF]
Discrete & Computational Geometry, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eyal Ackerman, Rom Pinchasi
openaire +2 more sources
On the crossing number for Kronecker product of a tripartite graph with path
AKCE International Journal of Graphs and Combinatorics, 2020 The crossing number of a graph G, Cr(G) is the minimum number of edge crossings overall good drawings of G. Among the well-known four standard graph products namely Cartesian product, Kronecker product, strong product and lexicographic product, the one ...
N. Shanthini, J. Baskar Babujee
doaj +1 more source
Software Solution of the Algorithm of the Cyclic-Order Graph [PDF]
Acta Electrotechnica et Informatica, 2018 In this paper we describe by pseudo-code the ``Algorithm of the cyclic-order graph'', which we programmed in MATLAB 2016a and which is also possible to be executed in GNU Octave. We describe program's functionality and its use.
Štefan Berežný +2 more
doaj +1 more source
The crossing numbers of join products of paths with three graphs of order five [PDF]
Opuscula Mathematica, 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\) vertices.
Michal Staš, Mária Švecová
doaj +1 more source
Cyclic Permutations in Determining Crossing Numbers
Discussiones Mathematicae Graph Theory, 2022 The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied.
Klešč Marián, Staš Michal
doaj +1 more source
On the crossing number of join product of the discrete graph with special graphs of order five
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 +1 more source
The Crossing Number of Hexagonal Graph H3,n in the Projective Plane
Discussiones Mathematicae Graph Theory, 2022 Thomassen described all (except finitely many) regular tilings of the torus S1 and the Klein bottle N2 into (3,6)-tilings, (4,4)-tilings and (6,3)-tilings.
Wang Jing +3 more
doaj +1 more source
Crossing Numbers and Cutwidths [PDF]
Journal of Graph Algorithms and Applications, 2003 Summary: The crossing number of a graph \(G= (V, E)\), denoted by \(\text{cr}(G)\), is the smallest number of edge crossings in any drawing of \(G\) in the plane. We assume that the drawing is good, i.e., incident edges do not cross, two edges cross at most once and at most two edges cross in a point of the plane. \textit{F. T.
Hristo N. Djidjev, Imrich Vrto
openaire +2 more sources
The Toroidal Crossing Number [PDF]
, 2011 Studying the crossing number of the complete bipartite graph K4,n in ...
Ling, Tang +2 more
core +1 more source