Results 101 to 110 of about 978,529 (303)
Loss of proton‐sensing TDAG8 increases tumor progression in mouse models of colon cancer
Molecular Oncology, EarlyView.Loss of the pH‐sensing receptor TDAG8 accelerates colorectal cancer progression in mice. Animals lacking TDAG8 expression had increased tumor growth, DNA damage, and recruitment of tumor‐associated immune cells, including macrophages, neutrophils, and monocytes.
Ermanno Malagola +11 more
wiley +1 more source
An upper bound for star chromatic index of simple connected sub-cubic graphs and applications
Journal of the National Science Foundation of Sri LankaThis paper explores the star edge coloring of simple connected sub-cubic graphs, which is a more restricted way of edge coloring. The idea of star edge coloring was introduced by two mathematicians Liu and Deng in 2008, motivated by its vertex version ...
C. L. R. Fernando +1 more
doaj +1 more source
The Strong Edge-Coloring of Graphs [PDF]
A proper edge-coloring of a graph G is called a strong edge-coloring if any two edges joined by another edge receive distinct colors. It is clear that in a strong edge-coloring, every color class forms an induced matching.
Zhou, Xiangqian
core
Molecular Oncology, EarlyView.Matched spatial transcriptomics and single‐nuclei RNA‐seq were generated for anaplastic and BRAFV600E papillary thyroid cancers revealing generic and tumor‐specific states occurring in cancer cells and in the tumor microenvironment. In this context, cancer dedifferentiation mirrored organoid maturation through ordered thyroid marker gain/loss ...
Adrien Tourneur +11 more
wiley +1 more source
Recent progress on strong edge-coloring of graphs
, 2019 A strong edge-coloring of a graph G = (V,E) is a partition of its edge set E into induced matchings.
Deng, Kecai, Yu, Gexin, Zhou, Xiangqian
core +1 more source
Edge-DP-Coloring of Graphs [PDF]
, 2023 A proper coloring of a graph $G$ is an assignment of colors to all vertices in $G$ so that adjacent vertices receive different colors. In this thesis, we will introduce a generalization of a coloring problem known as DP-coloring.
Minjung Kang
core
Molecular Oncology, EarlyView.Drug resistance limits treatment success in a subset of lung cancers driven by ROS1 gene alterations. Using patient‐derived cells and computer simulations, we studied three key mutations and how they affect five targeted drugs. The mutations reduced drug effectiveness in different ways by altering protein structure and behavior.
Farhan Ul Haq +8 more
wiley +1 more source
CEACAM1 participation in breast cancer progression
Molecular Oncology, EarlyView.In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin +3 more
wiley +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
Edge Coloring Of Cactus Graphs With Given Spectrums
, 2021 An edge-coloring of a graph G is a coloring of the graph edges with integers such that the colors of the edges incident to any vertex of G are distinct. For an edge coloring α and a vertex v the set of all the colors of the incident edges of v is called ...
Sahakyan, A. K. (Albert)
core