Results 81 to 90 of about 9,430 (262)
Edge-Coloring Problems for Graphs.
Summary: The edge-coloring problem is one of the fundamental problems on graphs, which often appears in various scheduling problems like the file transfer problem on computer networks. We survey old and new results on the classical edge-coloring problem as well as generalized edge-coloring problems, called the \(f\)-coloring and \(fg\)-coloring ...
NAKANO, Shin-ichi, NISHIZEKI, Takao
openaire +2 more sources
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 Colored hypergraphic Arrangements [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Fractional Q-Edge-Coloring of Graphs
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs.
Czap Július, Mihók Peter
doaj +1 more source
On harmonious coloring of hypergraphs [PDF]
A harmonious coloring of a $k$-uniform hypergraph $H$ is a vertex coloring such that no two vertices in the same edge have the same color, and each $k$-element subset of colors appears on at most one edge. The harmonious number $h(H)$ is the least number
Sebastian Czerwiński
doaj +1 more source
Even edge colorings of a graph
It is shown that the minimum number of colors needed to paint the edges of a graph G so that in every cycle of G there is a nonzero even number of edges of at least one color is \(\lceil \log_ 2\chi (G)\rceil\), where \(\chi\) (G) denotes the vertex chromatic number of G, and \(\lceil \rceil\) denotes the least integer not less than the number inside ...
Noga Alon, Yoshimi Egawa
openaire +1 more source
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
Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma
Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski +10 more
wiley +1 more source
Strong Edge-Coloring Of Planar Graphs
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

