Results 71 to 80 of about 82,884 (244)
A Note On Vertex Colorings Of Plane Graphs
Discussiones Mathematicae Graph Theory, 2014 Given an integer valued weighting of all elements of a 2-connected plane graph G with vertex set V , let c(v) denote the sum of the weight of v ∈ V and of the weights of all edges and all faces incident with v.
Fabricia Igor +2 more
doaj +1 more source
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source
A note on face coloring entire weightings of plane graphs
Discussiones Mathematicae Graph Theory, 2014 Given a weighting of all elements of a 2-connected plane graph G = (V,E, F), let f(α) denote the sum of the weights of the edges and vertices incident with the face _ and also the weight of _.
Jendrol Stanislav, Šugerek Peter
doaj +1 more source
Dual targeting of RET and SRC synergizes in RET fusion‐positive cancer cells
Molecular Oncology, EarlyView.Despite the strong activity of selective RET tyrosine kinase inhibitors (TKIs), resistance of RET fusion‐positive (RET+) lung cancer and thyroid cancer frequently occurs and is mainly driven by RET‐independent bypass mechanisms. Son et al. show that SRC TKIs significantly inhibit PAK and AKT survival signaling and enhance the efficacy of RET TKIs in ...
Juhyeon Son +13 more
wiley +1 more source
On the Weight of Minor Faces in Triangle-Free 3-Polytopes
Discussiones Mathematicae Graph Theory, 2016 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
On d-antimagic labelings of plane graphs
Electronic Journal of Graph Theory and Applications, 2013 The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face.
Martin Baca +4 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1983 AbstractIt is proven that, if Γ0 and Γ1 are isomorphic strictly convex graphs such that their outer polygons correspond to each other and have the same orientations, then Γ0 can be continuously deformed into Γ1 such that, at each stage, the graph under consideration is convex. This extends a result of Cairns (Ann of Math.
openaire +2 more sources
Molecular Oncology, EarlyView.We developed and validated a DNA methylation–based biomarker panel to distinguish pleural mesothelioma from other pleural conditions. Using the IMPRESS technology, we translated this panel into a clinically applicable assay. The resulting two classifier models demonstrated excellent performance, achieving high AUC values and strong diagnostic accuracy.
Janah Vandenhoeck +12 more
wiley +1 more source
WORM Colorings of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the
Czap J., Jendrol’ S., Valiska J.
doaj +1 more source
Molecular Oncology, EarlyView.We developed a cost‐effective methylation‐specific droplet digital PCR multiplex assay containing tissue‐conserved and tumor‐specific methylation markers. The assay can detect circulating tumor DNA with high accuracy in patients with localized and metastatic colorectal cancer.
Luisa Matos do Canto +8 more
wiley +1 more source