Results 111 to 120 of about 568,500 (305)
Facial [r,s,t]-Colorings of Plane Graphs
Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E → {1, . .
Czap Július +3 more
doaj +1 more source
On d-antimagic labelings of plane graphs
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
Bipartite partial duals and circuits in medial graphs
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented circuits in its
A Asratian +18 more
core +2 more sources
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
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
Dual targeting of RET and SRC synergizes in RET fusion‐positive cancer cells
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
Which point sets admit a $k$-angulation?
For \(k\ge 3\), a \(k\)-angulation is a 2-connected plane graph in which every internal face is a \(k\)-gon. We say that a point set \(P\) admits a plane graph \(G\) if there is a straight-line drawing of \(G\) that maps \(V(G)\) onto \(P\) and has the ...
Michael S. Payne +2 more
doaj +1 more source
Abstract The rainbowness, rb ( G ) , of a connected plane graph G is the minimum number k such that any colouring of vertices of the graph G using at least k colours involves a face all vertices of which receive distinct colours. We give a survey on recent results concerning ranbowness of plane graphs.
openaire +1 more source
Generation of two normal and tumour (cancerous) paired human cell lines using an established tissue culture technique and their characterisation is described. Cell lines were characterised at cellular, protein, chromosome and gene expression levels and for HPV status.
Simon Broad +12 more
wiley +1 more source
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

