Results 71 to 80 of about 115,444 (312)
PROPERTIES OF UNIQUELY K-LIST COLORABLE COMPLETE SPLIT GRAPHS
Tạp chí Khoa học Đại học Đà Lạt, 2020 Let G be a graph with n vertices. Suppose that for each vertex v in G there exists a list L(v) of k colors, such that there is a unique proper coloring for G from this collection of lists, then G is called a uniquely k-list colorable graph.
Lê Xuân Hùng
doaj +1 more source
Journal of Natural Fibers, 2023 Environmental awareness has become more important among individuals and societies in recent years. The increasing awareness and sensitivity to the environment have made the reintroduction of natural dyes in the textile industries even more important.
Recep Karadag
doaj +1 more source
Molecular Oncology, EarlyView.ERRFI1, a neural crest (NC)‐associated gene, was upregulated in melanoma and negatively correlated with the expression of melanocytic differentiation markers and the susceptibility of melanoma cells toward BRAF inhibitors (BRAFi). Knocking down ERRFI1 significantly increased the sensitivity of melanoma cells to BRAFi.
Nina Wang +8 more
wiley +1 more source
Choice Numbers of Multi-Bridge Graphs [PDF]
Computer Science Journal of Moldova, 2017 Suppose $ch(G)$ and $\chi(G)$ denote, respectively, the choice number and the chromatic number of a graph $G=(V,E)$. If $ch(G)=\chi(G)$, then $G$ is said to be chromatic-choosable.
Julian Allagan, Benkam Bobga
doaj
Molecular Oncology, EarlyView.A mouse model for vascular normalization and a human breast cancer cohort were studied to understand the relationship between vascular leakage and tumor immune suppression. For this, endothelial and immune cell RNAseq, staining for vascular function, and immune cell profiling were employed.
Liqun He +8 more
wiley +1 more source
List-coloring and sum-list-coloring problems on graphs
, 2018 Graph coloring is a well-known and well-studied area of graph theory that has many applications. In this dissertation, we look at two generalizations of graph coloring known as list-coloring and sum-list-coloring. In both of these types of colorings, one seeks to first assign palettes of colors to vertices and then choose a color from the corresponding
openaire +3 more sources
Kempe equivalent list colorings revisited
Journal of Graph TheoryAbstractA Kempe chain on colors and is a component of the subgraph induced by colors and . A Kempe change is the operation of interchanging the colors of some Kempe chains. For a list‐assignment and an ‐coloring , a Kempe change is ‐valid for if performing the Kempe change yields another ‐coloring. Two ‐colorings are ‐equivalent if we can form one
Dibyayan Chakraborty +2 more
openaire +4 more sources
Molecular Oncology, EarlyView.Clinical trials on PARP inhibitors in urothelial carcinoma (UC) showed limited efficacy and a lack of predictive biomarkers. We propose SLFN5, SLFN11, and OAS1 as UC‐specific response predictors. We suggest Talazoparib as the better PARP inhibitor for UC than Olaparib.
Jutta Schmitz +15 more
wiley +1 more source
List Supermodular Coloring with Shorter Lists [PDF]
Combinatorica, 2018 In 1995, Galvin proved that a bipartite graph $G$ admits a list edge coloring if every edge is assigned a color list of length $ (G)$, the maximum degree of the graph. This result was improved by Borodin, Kostochka and Woodall, who proved that $G$ still admits a list edge coloring if every edge $e=st$ is assigned a list of $\max\{d_{G}(s), d_{G}(t)\}$
openaire +2 more sources
Molecular Oncology, EarlyView.Generation of two normal and tumour (cancerous) paired human cell lines using an established tissue culture technique and their characterisation is described. Cell lines were characterised at cellular, protein, chromosome and gene expression levels and for HPV status.
Simon Broad +12 more
wiley +1 more source