Results 81 to 90 of about 934,158 (291)
We develop the theory of the edge coloring of infinite lattice graphs, proving a necessary and sufficient condition for a proper edge coloring of a patch of a lattice graph to induce a proper edge coloring of the entire lattice graph by translation. This
Kattemölle, Joris
core +2 more sources
Edge-Locating Coloring of Graphs
, 2023 An edge-locating coloring of a simple connected graph $G$ is a partition of its edge set into matchings such that the vertices of $G$ are distinguished by the distance to the matchings.
Baskoro, Edy Tri +3 more
core
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
Edge coloring of a graph [PDF]
, 2004 Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2004Includes bibliographical references (leaves: 35-36)Text in English; Abstract: Turkish and Englishviii, 36 leavesThe edge coloring problem is one of the fundamental problem on graphs ...
Beşeri, Tina
core +1 more source
Maximal edge colorings of graphs
European Journal of CombinatoricsFor a graph $G$ of order $n$ a maximal edge coloring is a proper edge coloring with $χ'(K_n)$ colors such that adding any edge to $G$ in any color makes it improper. Meszka and Tyniec proved that for some values of the number of edges there are no graphs with a maximal edge coloring, while for some other values, they provided constructions of such ...
Sebastian Babinski, Andrzej Grzesik
openaire +7 more sources
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.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
Tight Lower Bounds for List Edge Coloring [PDF]
, 2018 The fastest algorithms for edge coloring run in time 2^m n^{O(1)}, where m and n are the number of edges and vertices of the input graph, respectively. For dense graphs, this bound becomes 2^{Theta(n^2)}.
Kowalik, Lukasz, Socala, Arkadiusz
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