Results 61 to 70 of about 971,776 (299)
A degree sequence Hajnal-Szemerédi theorem [PDF]
We say that a graph G has a perfect H-packing if there exists a set of vertex-disjointcopies of H which cover all the vertices in G. The seminal Hajnal–Szemer´edi theorem [12] characterises the minimum degree that ensures a graph G contains a perfect Kr ...
Treglown, Andrew
core +1 more source
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
Computing the sum of k largest Laplacian eigenvalues of tricyclic graphs [PDF]
Pawan Kumar +2 more
doaj +1 more source
Teorija grafova je od velikog značaja u različitim područjima znanosti. Jednostavni konačni grafovi predstavljaju značajnu vrstu grafova. U ovom završnom radu se razmatra niz stupnjeva konačnog jednostavnog grafa, pojam usko vezan uz osnovne elemente ...
Begović, Dolores
core
ABSTRACT Background An internal tandem duplication in the gene encoding Fms‐like tyrosine kinase 3 (FLT3‐ITD) is associated with high relapse risk and poor prognosis in acute myeloid leukemia (AML) and plays a crucial role in treatment decisions. Measurable residual disease (MRD) analysis of FLT3‐ITD during and after treatment has shown prognostic ...
Sofie Johansson Alm +11 more
wiley +1 more source
ABSTRACT Immune effector cell‐associated hemophagocytic lymphohistiocytosis‐like syndrome (IEC‐HS) is a life‐threatening hyperinflammatory toxicity distinct from cytokine release syndrome (CRS) and neurotoxicity following chimeric antigen receptor T‐cell (CAR‐T) therapy. In a single‐institution retrospective cohort of pediatric and young adult patients
Thomas J. Galletta +6 more
wiley +1 more source
Bipartite Digraphical Degree Sequence Problem [PDF]
application/pdf論文(Article)A sequence of nonnegative integers S= (s₁, s₂, · · · ·, sn) is graphical if there is a graph with vertices v₁, V₂, · · · ·, Vn such that deg(vj) = si for each j = 1, 2, · · · ·, n. The graphical degree sequence problem is: Given
3291, TAKAHASHI, Masaya
core
Integer points in the degree-sequence polytope
An integer vector $b \in \mathbb{Z}^d$ is a degree sequence if there exists a hypergraph with vertices $\{1,\dots,d\}$ such that each $b_i$ is the number of hyperedges containing $i$. The degree-sequence polytope $\mathscr{Z}^d$ is the convex hull of all
Pinchasi, Rom +2 more
core
ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source
Minimum-Loop Realization of Degree Sequences
Given a finite sequence D of nonnegative integers, let M(D) denote its maximum element and S(D) its sum. It is known that D is realizable as a degree sequence by some graph if and only if S(D) is even, and by a loopless graph if and only if the even ...
Goldman, A.J.; Byrd, R.H.
core +1 more source

