Results 111 to 120 of about 14,237 (338)
On the complexity of a restricted list-coloring problem
, 1999 We investigate a restricted list-coloring problem. Given a graph G = (V, E), a non empty set of colors L, and a nonempty subset L(v) of L for each vertex v, find an L-coloring of G with the size of each class of colors being equal to a given integer ...
Finke, Gerd +3 more
core +1 more source
MiR‐513a promotes human erythroid differentiation by modulating c‐Jun
FEBS Open Bio, EarlyView.During early human erythropoiesis, miR‐513a promoted erythroid differentiation in primary human CD34+ hematopoietic stem‐progenitor cells and human TF‐1 erythroleukemic cells by indirectly decreasing c‐Jun and phospho‐c‐Jun expression, which are associated with increased GATA1 expression.
MinJung Kim +11 more
wiley +1 more source
FEBS Open Bio, EarlyView.Activation of the mitochondrial protein OXR1 increases pSyn129 αSynuclein aggregation by lowering ATP levels and altering mitochondrial membrane potential, particularly in response to MSA‐derived fibrils. In contrast, ablation of the ER protein EMC4 enhances autophagic flux and lysosomal clearance, broadly reducing α‐synuclein aggregates.
Sandesh Neupane +11 more
wiley +1 more source
A Branch and Price Algorithm for List Coloring Problem [PDF]
, 2019 Coloring problems in graphs have been used to model a wide range of real applications. In particular, the List Coloring Problem generalizes the well-known Graph Coloring Problem for which many exact algorithms have been developed.
Nasini, Graciela Leonor +2 more
core +1 more source
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
MathematicsIn order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj +1 more source
Российский паразитологический журнал, 2019 The technique of staining on the activity of acid phosphatase has been modified, which makes it possible to differentiate between larvae of the first stage of nematodes of four species: Dirofilaria immitis, D. repens, Acanthocheilonema dracunculoides, A.
V. M. Shaytanov, V. B. Yastreb
doaj +1 more source
FEBS Open Bio, EarlyView.Evolutionary analysis across 32 placental mammals identified positive selection at residues H148 and W149 in the immune receptor FcγR1. Ancestral reconstruction combined with molecular dynamics simulations reveals how these mutations may influence receptor structure and dynamics, providing insight into the evolution of antibody recognition and immune ...
David A. Young +7 more
wiley +1 more source
Extension of a list coloring problem
Applied Mathematics Letters, 2006 For a graph \(G\), let \(f(G)\) be the minimum integer \(k\) such that the graph formed from \(G\) by adding \(k\) independent vertices and joining each of them with all vertices of \(G\) is not \(| V(G)| \)-choosable. The quantity \(f(G)\) is related to some properties of Nordhaus-Gaddum type and it was studied previously by \textit{S.
Baoyindureng Wu, Li Zhang 0009
openaire +2 more sources
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Five-list-coloring graphs on surfaces III. One list of size one and one\n list of size two [PDF]
, 2016 Luke Postle, Robin Thomas
openalex +1 more source