Results 91 to 100 of about 978,529 (303)
Strong edge coloring sparse graphs
, 2015 International audienceA strong edge coloring of a graph is a proper edge coloring such that no edge has two incident edges of the same color. Erdős and Nešetřil conjectured in 1989 that $5 /4∆2$ colors are always enough for a strong edge coloring, where $
Hocquard, Hervé +2 more
core +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
Molecular Oncology, EarlyView.Pair‐wise comparison of the CellSearch and FETCH enrichment technologies for circulating tumor cells (CTCs) from metastatic breast, prostate, and small cell lung cancer patients shows an increased capture of CTCs using FETCH enrichment. The clinical implementation of circulating tumor cells (CTCs) as a predictive tool for therapy efficacy in the ...
Michiel Stevens +6 more
wiley +1 more source
Ars Mathematica Contemporanea, 2015 An edge coloring of a graph G is said to be an odd edge coloring if for each vertex v ofG and each colorc, the vertexv uses the colorc an odd number of times or does not use it at all. In [5], Pyber proved that 4 colors suffice for an odd edge coloring of any simple graph.
Borut Luzar +2 more
openaire +4 more sources
Molecular Oncology, EarlyView.We identify USP29 as the only DUB mirroring CA9 expression, a marker of hypoxia and HIF pathway activation associated with PCA aggressiveness. USP29 stabilizes HIF‐1α and HIF‐2α via a noncanonical mechanism that is independent of PHD/pVHL activity yet relies on proteasomal regulation, establishing USP29 as a previously unrecognized regulator of hypoxic
Amelie S Schober +16 more
wiley +1 more source
Injective edge coloring of sparse graphs
, 2018 A [Formula: see text]-injective edge coloring of a graph [Formula: see text] is a coloring [Formula: see text], such that if [Formula: see text], [Formula: see text] and [Formula: see text] are consecutive edges in [Formula: see text], then [Formula ...
Chentao Qi, Yuehua Bu
core +1 more source
Molecular Oncology, EarlyView.The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka +9 more
wiley +1 more source
Regular Colorings in Regular Graphs
Discussiones Mathematicae Graph Theory, 2020 An (r − 1, 1)-coloring of an r-regular graph G is an edge coloring (with arbitrarily many colors) such that each vertex is incident to r − 1 edges of one color and 1 edge of a different color.
Bernshteyn Anton +6 more
doaj +1 more source
Algorithmic Aspect of Edge-Coloring
, 2007 Vizing的定理敘述一個簡單圖 $G$ 能使用 $Delta (G)+1$ 顏色做邊著色，$Delta (G)$ 為圖 $G$ 的度數。這立即引進了分類的問題─假如最少著色數 $chi '(G)=Delta (G)$，$G$ 為 class one;否則 $G$ 為 class two。本論文延伸了Vizing的定理，介紹一個新的想法，假如我們要對 $G$的一個邊做著色且這個邊在 $k$ 顏色下滿足未飽合條件，$k leq Delta (G)$，則這個邊可使用 $k$ 個顏色中的一個顏色做著色 ...
魏廷恩, Wei, Tin-En
core
Normal 5-edge-coloring of some snarks superpositioned by Flower snarks [PDF]
An edge e is normal in a proper edge-coloring of a cubic graph G if the number of distinct colors on four edges incident to e is 2 or 4: A normal edge-coloring of G is a proper edge-coloring in which every edge of G is normal.
Škrekovski, Riste, Sedlar, Jelena
core +1 more source