Results 81 to 90 of about 152,670 (312)

FINITELY DEPENDENT COLORING

open access: yesForum of Mathematics, Pi, 2016
We prove that proper coloring distinguishes between block factors and finitely dependent stationary processes. A stochastic process is finitely dependent if variables at sufficiently well-separated locations are independent; it is a block factor if it ...
ALEXANDER E. HOLROYD, THOMAS M. LIGGETT
doaj   +1 more source

On the total and AVD-total coloring of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v and ...
B. S. Panda, Shaily Verma, Yash Keerti
doaj   +1 more source

Patient‐specific pharmacogenomics demonstrates xCT as predictive therapeutic target in colon cancer with possible implications in tumor connectivity

open access: yesMolecular Oncology, EarlyView.
This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker   +16 more
wiley   +1 more source

Aggressive prostate cancer is associated with pericyte dysfunction

open access: yesMolecular Oncology, EarlyView.
Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero   +11 more
wiley   +1 more source

Equitable Colorings Of Corona Multiproducts Of Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one.
Furmánczyk Hanna   +2 more
doaj   +1 more source

The neural crest‐associated gene ERRFI1 is involved in melanoma progression and resistance toward targeted therapy

open access: yesMolecular Oncology, EarlyView.
ERRFI1, a neural crest (NC)‐associated gene, was upregulated in melanoma and negatively correlated with the expression of melanocytic differentiation markers and the susceptibility of melanoma cells toward BRAF inhibitors (BRAFi). Knocking down ERRFI1 significantly increased the sensitivity of melanoma cells to BRAFi.
Nina Wang   +8 more
wiley   +1 more source

Some Equal Degree Graph Edge Chromatic Number

open access: yesMATEC Web of Conferences, 2016
Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfied with f(e1)≠6 = f(e2) for two incident edges e1,e2∉E(G), f(e1)≠6=f(e2), then f is called the k-proper-edge coloring of G(k-PEC for short).
Liu Jun   +4 more
doaj   +1 more source

Reduced vascular leakage correlates with breast carcinoma T regulatory cell infiltration but not with metastatic propensity

open access: yesMolecular Oncology, EarlyView.
A mouse model for vascular normalization and a human breast cancer cohort were studied to understand the relationship between vascular leakage and tumor immune suppression. For this, endothelial and immune cell RNAseq, staining for vascular function, and immune cell profiling were employed.
Liqun He   +8 more
wiley   +1 more source

Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj   +1 more source

Home - About - Disclaimer - Privacy