Results 111 to 120 of about 543,681 (314)
We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witnesses W in the plane, there is an edge ab between two points of P in the witness Gabriel graph GG-(P,W) if and only if the closed ...
Aronov, Boris+2 more
core +2 more sources
Alectinib resistance in ALK+ NSCLC depends on treatment sequence and EML4‐ALK variants. Variant 1 exhibited off‐target resistance after first‐line treatment, while variant 3 and later lines favored on‐target mutations. Early resistance involved off‐target alterations, like MET and NF2, while on‐target mutations emerged with prolonged therapy.
Jie Hu+11 more
wiley +1 more source
This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani+14 more
wiley +1 more source
An Extension of Kotzig’s Theorem
In 1955, Kotzig proved that every 3-connected planar graph has an edge with the degree sum of its end vertices at most 13, which is tight. An edge uv is of type (i, j) if d(u) ≤ i and d(v) ≤ j.
Aksenov Valerii A.+2 more
doaj +1 more source
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao+2 more
doaj +1 more source
This nationwide study evaluated KRAS and NRAS mutations in 10 754 Turkish patients with metastatic colorectal cancer. The results revealed a mutation frequency of 51.1%, with 46.6% having KRAS mutations, 4.5% having NRAS mutations, and 48.5% being wild‐type for both.
Gozde Kavgaci+6 more
wiley +1 more source
Implementing path coloring algorithms on planar graphs [PDF]
Master's Project (M.S.) University of Alaska Fairbanks, 2017A path coloring of a graph partitions its vertex set into color classes such that each class induces a disjoint union of paths.
Bross, Daniel Aven
core
Plane graphs and link invariants
AbstractA (tame) link can be defined as a finite collection of disjoint polygons embedded in Euclidean 3-space. Links are usually represented by plane projections, or diagrams, which can be viewed as 4-regular plane graphs with signed vertices. Then the 3-dimensional concept of ambient isotopy of links can be described in combinatorial terms on ...
openaire +2 more sources
The pan‐HDAC inhibitor belinostat increases the expression of the pro‐apoptotic proteins Bim, Puma, and Noxa and induces apoptosis in ovarian cancer cell lines and patient‐derived tumor organoids when used at high concentrations. Moreover, inhibiting the anti‐apoptotic proteins Bcl‐xL or Mcl‐1 sensitizes these preclinical models to the cytotoxic effect
Cécilia Thomine+10 more
wiley +1 more source
On the Weight of Minor Faces in Triangle-Free 3-Polytopes
The weight w(f) of a face f in a 3-polytope is the degree-sum of vertices incident with f. It follows from Lebesgue’s results of 1940 that every triangle-free 3-polytope without 4-faces incident with at least three 3-vertices has a 4-face with w ≤ 21 or ...
Borodin Oleg V., Ivanova Anna O.
doaj +1 more source