Results 81 to 90 of about 39,087 (298)
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
Homomorphisms of 2-Edge-Colored Graphs
, 2007 In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2-trees, partial 3-trees, planar graphs, graphs with bounded maximum average
Sopena, Eric +4 more
core +1 more source
Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma
Molecular Oncology, EarlyView.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
Acyclic edge coloring of graphs
Discrete Applied Mathematics, 2014 19 ...
Tao Wang 0005, Yaqiong Zhang
openaire +2 more sources
Molecular Oncology, EarlyView.Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski +12 more
wiley +1 more source
Gallai-Ramsey Numbers for Rainbow S3+S_3^ + and Monochromatic Paths
Discussiones Mathematicae Graph Theory, 2022 Motivated by Ramsey theory and other rainbow-coloring-related problems, we consider edge-colorings of complete graphs without rainbow copy of some fixed subgraphs.
Li Xihe, Wang Ligong
doaj +1 more source
Homogeneous Edge-Colorings of Graphs
, 2012 Let G = (V, E) be a multigraph without loops and for any x {\in}V let E(x) be the set of edges of G incident to x. A homogeneous edge-coloring of G is an assignment of an integer m >= 2 and a coloring c:E {\to} S of the edges of Gsuchthat|S| = mandforanyx{\in}V,if|E(x)| = mqx+rx with0 < ...
BONACINI, PAOLA +2 more
openaire +3 more sources
Edge-colorability of graph bundles
Journal of Combinatorial Theory, Series B, 1983 AbstractThe topological notion of a fibre bundle is a generalization both of a Cartesian product and of a covering space. A graph bundle is a combinatorial analog of a fibre bundle. Accordingly, it is a generalization both of a Cartesian product of two graphs and of a covering graph. A “total graph”X is formed from a “base graph”B and “fibre”F.
Tomaz Pisanski +2 more
openaire +1 more source
Heterochromatic Matchings in Edge-Colored Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 Let $G$ be an (edge-)colored graph. A heterochromatic matching of $G$ is a matching in which no two edges have the same color. For a vertex $v$, let $d^c(v)$ be the color degree of $v$. We show that if $d^c(v)\geq k$ for every vertex $v$ of $G$, then $G$ has a heterochromatic matching of size $\big\lceil{5k-3\over 12}\big\rceil$.
Guanghui Wang 0002, Hao Li 0002
openaire +3 more sources
Homomorphisms of 2-edge-colored graphs
, 2010 In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2-trees, partial 3-trees, planar graphs) and the problem is to find, for ...
Raspaud, André +4 more
core +1 more source