Results 61 to 70 of about 10,813,555 (336)
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
Embeddings and immersions of tropical curves [PDF]
, 2015 We construct immersions of trivalent abstract tropical curves in the Euclidean plane and embeddings of all abstract tropical curves in higher dimensional Euclidean space.
Cartwright, Dustin +3 more
core +1 more source
On the Problems of
MathematicsA 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.
Michal Staš, Mária Timková
doaj +1 more source
Shellable Drawings and the Cylindrical Crossing Number of $$K_{n}$$Kn [PDF]
Discrete & Computational Geometry, 2013 The Harary–Hill Conjecture states that the number of crossings in any drawing of the complete graph $$K_n$$Kn in the plane is at least $$Z(n):=\frac{1}{4}\left\lfloor \frac{n}{2}\right\rfloor \left\lfloor \frac{n-1}{2}\right\rfloor \left\lfloor \frac{n-2}
B. Ábrego +4 more
semanticscholar +1 more source
The amplituhedron crossing and winding numbers
Journal of Geometry and Physics, 2023 In \cite{arkani2018unwinding}, Arkani-Hamed, Thomas and Trnka formulated two conjectural descriptions of the tree amplituhedron $\ampli$ depending on the parity of $m$. When $m$ is even, the description involves the winding number and when $m$ is odd the description involves the crossing number.
Xavier Blot, Jian-Rong Li
openaire +3 more sources
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
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard [PDF]
SIAM journal on computing (Print), 2012 A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs.
Sergio Cabello, B. Mohar
semanticscholar +1 more source
The unpredictably eruptive dynamics of spruce budworm populations in eastern Canada
Population Ecology, EarlyView.We examine historical population data for spruce budworm from several locations through the period 1930–1997, and use density‐dependent recruitment curves to test whether the pattern of population growth over time is more consistent with Royama's (1984; Ecological Monographs 54:429–462) linear R(t) model of harmonic oscillation at Green River New ...
Barry J. Cooke, Jacques Régnière
wiley +1 more source
Fixed parameter tractability of crossing minimization of almost-trees
, 2013 We investigate exact crossing minimization for graphs that differ from trees by a small number of additional edges, for several variants of the crossing minimization problem.
Bannister, Michael J. +2 more
core +1 more source
The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
Discussiones Mathematicae Graph Theory, 2018 There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Ding Zongpeng, Huang Yuanqiu
doaj +1 more source