Results 101 to 110 of about 153,059 (312)
On $(t-1)$-colored paths in $t$-colored complete graphs
Bulletin of the Belgian Mathematical Society - Simon Stevin, 2018 Given $t$ distinct colors, the $t$ subsets of $t-1$ colors are ordered in some arbitrary manner. Let $(G_1, G_2, \ldots, G_t)$ be graphs. The $(t-1)$-chromatic Ramsey number, denoted by $r_{t-1}^t(G_1, G_2, \ldots, G_t)$, is defined to be the least number $n$ such that if the edges of the complete graph $K_n$ are colored in any fashion with $t$ colors,
openaire +3 more sources
Plecstatin inhibits hepatocellular carcinoma tumorigenesis and invasion through cytolinker plectin
Molecular Oncology, EarlyView.The ruthenium‐based metallodrug plecstatin exerts its anticancer effect in hepatocellular carcinoma (HCC) primarily through selective targeting of plectin. By disrupting plectin‐mediated cytoskeletal organization, plecstatin inhibits anchorage‐dependent growth, cell polarization, and tumor cell dissemination.
Zuzana Outla +10 more
wiley +1 more source
Molecular Oncology, EarlyView.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Rooted Complete Minors in Line Graphs with a Kempe Coloring [PDF]
, 2019 Matthias Kriesell, Samuel Mohr
openalex +1 more source
Molecular Oncology, EarlyView.This study shows that copy number variations (CNVs) can be reliably detected in formalin‐fixed paraffin‐embedded (FFPE) solid cancer samples using ultra‐low‐pass whole‐genome sequencing, provided that key (pre)‐analytical parameters are optimized.
Hanne Goris +10 more
wiley +1 more source
The coloring complex and cyclic coloring complex of a complete k-uniform\n hypergraph [PDF]
, 2011 Sarah Crown Rundell
openalex +2 more sources
K3-Worm Colorings of Graphs: Lower Chromatic Number and Gaps in the Chromatic Spectrum
Discussiones Mathematicae Graph Theory, 2016 A K3-WORM coloring of a graph G is an assignment of colors to the vertices in such a way that the vertices of each K3-subgraph of G get precisely two colors. We study graphs G which admit at least one such coloring. We disprove a conjecture of Goddard et
Bujtás Csilla, Tuza Zsolt
doaj +1 more source
The complete list of Ramsey $(2K_2,K_4)$-minimal graphs
Electronic Journal of Graph Theory and Applications, 2015 Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F ...
Kristiana Wijaya +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Single circulating tumor cells (sCTCs) from high‐grade serous ovarian cancer patients were enriched, imaged, and genomically profiled using WGA and NGS at different time points during treatment. sCTCs revealed enrichment of alterations in Chromosomes 2, 7, and 12 as well as persistent or emerging oncogenic CNAs, supporting sCTC identity.
Carolin Salmon +9 more
wiley +1 more source
Correlation of the differential expression of PIK3R1 and its spliced variant, p55α, in pan‐cancer
Molecular Oncology, EarlyView.PIK3R1 undergoes alternative splicing to generate the isoforms, p85α and p55α. By combining large patient datasets with laboratory experiments, we show that PIK3R1 spliced variants shape cancer behavior. While tumors lose the protective p85α isoform, p55α is overexpressed, changes linked to poorer survival and more pronounced in African American ...
Ishita Gupta +10 more
wiley +1 more source