Results 101 to 110 of about 14,669 (262)
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
Uniquely Restricted Matchings and Edge Colorings [PDF]
, 2017 23 pages, 11 ...
Baste, Julien +2 more
openaire +3 more sources
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
Basroparib inhibits YAP‐driven cancers by stabilizing angiomotin
Molecular Oncology, EarlyView.Basroparib, a selective tankyrase inhibitor, suppresses Wnt signaling and attenuates YAP‐driven oncogenic programs by stabilizing angiomotin. It promotes AMOT–YAP complex formation, enforces cytoplasmic YAP sequestration, inhibits YAP/TEAD transcription, and sensitizes YAP‐active cancers, including KRAS‐mutant colorectal cancer, to MEK inhibition.
Young‐Ju Kwon +4 more
wiley +1 more source
Fractional Q-Edge-Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2013 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
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.
Lužar, Borut +2 more
openaire +3 more sources
Molecular Oncology, EarlyView.Meta‐transcriptome analysis identified FGF19 as a peptide enteroendocrine hormone associated with colorectal cancer prognosis. In vivo xenograft models showed release of FGF19 into the blood at levels that correlated with tumor volumes. Tumoral‐FGF19 altered murine liver metabolism through FGFR4, thereby reducing bile acid synthesis and increasing ...
Jordan M. Beardsley +5 more
wiley +1 more source
Molecular Oncology, EarlyView.Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source
Strong Edge-Coloring Of Planar Graphs
Discussiones Mathematicae Graph Theory, 2017 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
On harmonious coloring of hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA 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