Results 81 to 90 of about 308,302 (304)
The crossing number of Pn2□C3 [PDF]
, 2012 The exact crossing number is known only for a few specific families of graphs. Cartesian products of two graphs belong to the first families of graphs for which the crossing number has been studied. Let Pn be a path with n+1 vertices. Pnk, the k-power of
Klešč, Marián +3 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Neurodevelopmental and neurocognitive difficulties are prevalent among individuals with sickle cell disease and warrant prompt identification and support. This Special Report provides an executive summary of standards and recommendations for surveillance, screening, and evaluation for development and cognition across the lifespan developed by ...
Alyssa M. Schlenz +12 more
wiley +1 more source
The crossing number of K1,m,n [PDF]
, 2008 A longstanding problem of crossing number, Zarankiewicz’s conjecture, asserts that the crossing number of the complete bipartite graph Km,n is ⌊m2⌋⌊m−12⌋⌊n2⌋⌊n−12⌋, which is known only for m≤6. It is natural to generalize Zarankiewicz conjecture and ask:
Ho, Pak Tung
core +1 more source
Selection strategies for the development of maize introgression populations. [PDF]
PLoS ONE, 2014 Introgression libraries are valuable resources for QTL detection and breeding, but their development is costly and time-consuming. Selection strategies for the development of introgression populations with a limited number of individuals and high ...
Eva Herzog +5 more
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
ON THE SATELLITE CROSSING NUMBER CONJECTURE [PDF]
, 2011 We prove some estimates on the crossing number of satellites of adequate, and partly of semiadequate knots. We mostly deal with classical cables, obtaining the first examples where the asymptotic cable crossing number is shown to be equal to the ...
A. STOIMENOW
core +1 more source
Conjectures About Wheels Without One Edge with Paths and Cycles
MathematicsThe 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 aim of this paper is to give the crossing numbers of the join products G*+Pn and G*+Cn for the connected graph G* obtained by ...
Michal Staš, Mária Timková
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\).
János Pach +2 more
openaire +2 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Maintenance hemodialysis (MHD) patients frequently suffer from frailty, characterized by reduced physical function and poor prognosis. Myokines, such as myonectin, secreted by muscle, are emerging regulators of systemic health. This study investigated the relationship between serum myonectin, adipokines (adiponectin, omentin), and ...
Kenichi Kono +7 more
wiley +1 more source
Cubicity, degeneracy, and crossing number
European Journal of Combinatorics, 2014 A $k$-box $B=(R_1,...,R_k)$, where each $R_i$ is a closed interval on the real line, is defined to be the Cartesian product $R_1\times R_2\times ...\times R_k$. If each $R_i$ is a unit length interval, we call $B$ a $k$-cube. Boxicity of a graph $G$, denoted as $\boxi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-boxes ...
Abhijin Adiga +2 more
openaire +4 more sources