Results 101 to 110 of about 978,459 (257)
Molecular Oncology, EarlyView.Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche +10 more
wiley +1 more source
Strong Edge-Coloring Of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 A strong edge-coloring of a graph is a proper edge-coloring where each color class induces a matching. We denote by 𝜒's(G) the strong chromatic index of G which is the smallest integer k such that G can be strongly edge-colored with k colors. It is known
Song Wen-Yao, Miao Lian-Ying
doaj +1 more source
Parameterized Complexity of Maximum Edge Coloring in Graphs [PDF]
, 2012 The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring.
Goyal, Prachi
core
Molecular Oncology, EarlyView.This study identifies somatostatin receptor 4 (Sstr4) as a critical tumor suppressor against skin and head/neck cancers (HNSCC, cSCC, and BCC). The loss of Sstr4 removes a check on cell growth, causing hyperactivation of the MAPK‐ERK signaling pathway (↑).
Ali Taqvi +6 more
wiley +1 more source
Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture
, 2012 Features recent advances and new applications in graph edge coloring Reviewing recent advances in the Edge Coloring Problem, Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture provides an overview of the current state of the science ...
Scheide, Diego +3 more
core
On facial unique-maximum (edge-)coloring [PDF]
, 2018 A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face α the maximal color appears exactly once on the vertices of α.
Riste Škrekovski +7 more
core +1 more source
Molecular Oncology, EarlyView.This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic +10 more
wiley +1 more source
Zhejiang Daxue xuebao. Lixue ban, 2017 A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors.
WANGGuoxing(王国兴)
doaj +1 more source
Injective edge coloring of graphs [PDF]
, 2019 Three edges $e_{1}, e_{2}$ and $e_{3}$ in a graph $G$ are consecutive if they form a path (in this order) or a cycle of lengths three. An injective edge coloring of a graph $G = (V,E)$ is a coloring $c$ of the edges of $G$ such that if $e_{1}, e_{2}$ and
Cardoso, Domingos M. +3 more
core +1 more source
Molecular Oncology, EarlyView.Loss of eIF5A rewires thapsigargin‐mediated endoplasmic reticulum stress responses in multiple myeloma cells by selective translation of mRNA transcripts, consequently dampening thapsigargin‐induced unfolded protein response (UPR) activation and shifting the balance from induction of apoptosis toward cell survival and proliferation.
Demi Both +7 more
wiley +1 more source