Results 51 to 60 of about 1,321,651 (326)
Crossing Numbers of Periodic Graphs [PDF]
Journal of Graph Theory, 2015 AbstractA graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Richter [1, Problem 4.2].
Dvořák, Zdeněk, Mohar, Bojan
openaire +3 more sources
Exactly Solvable Lattice Models with Crossing Symmetry [PDF]
, 2012 We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry.
Fendley, Paul, Simon, Steven H.
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
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
A Note on the Crossing Numbers of 5-Regular Graphs
Discussiones Mathematicae Graph Theory, 2020 The crossing number cr(G) of a graph G is the smallest number of edge crossings in any drawing of G. In this paper, we prove that there exists a unique 5-regular graph G on 10 vertices with cr(G) = 2.
Ouyang Zhangdong
doaj +1 more source
New Bounds on Crossing Numbers [PDF]
Discrete & Computational Geometry, 1999 The notation \(f(n)\ll g(n)\) means that, as \(n\) goes to infinity, \(g(n)/f(n)\) goes to infinity also. For \(g\geq 0\), let \(S_g\) denote the closed orientable 2-manifold of genus \(g\), with \(\text{cr}_g(G)\) the minimum number of crossing points among all drawings of the graph \(G\) on \(S_g\).
Pach, J., Spencer, J., Tóth, G.
openaire +2 more sources
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
Sickle Cell Disease Is an Inherent Risk for Asthma in a Sibling Comparison Study
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction Sickle cell disease (SCD) and asthma share a complex relationship. Although estimates vary, asthma prevalence in children with SCD is believed to be comparable to or higher than the general population. Determining whether SCD confers an increased risk for asthma remains challenging due to overlapping symptoms and the ...
Suhei C. Zuleta De Bernardis +9 more
wiley +1 more source
An Evolutionary Formulation of the Crossing Number Problem
Discrete Dynamics in Nature and Society, 2009 A graph drawing algorithm is presented which results in complete graphs having minimum crossings equal to that of Guy's conjecture. It is then generalized and formulated in an evolutionary algorithm (EA) to perform constrained search for the crossing ...
Che Sheng Gan +3 more
doaj +1 more source
Psychosocial Outcomes in Patients With Endocrine Tumor Syndromes: A Systematic Review
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction The combination of disease manifestations, the familial burden, and varying penetrance of endocrine tumor syndromes (ETSs) is unique. This review aimed to portray and summarize available data on psychosocial outcomes in patients with ETSs and explore gaps and opportunities for future research and care.
Daniël Zwerus +6 more
wiley +1 more source