Results 61 to 70 of about 14,237 (338)
Discussiones Mathematicae Graph Theory, 2020 If S = (a1, a2, . . .) is a non-decreasing sequence of positive integers, then an S-packing coloring of a graph G is a partition of V (G) into sets X1, X2, . . .
Brešar Boštjan +3 more
doaj +1 more source
Online list coloring for signed graphs
, 2022 We generalize the notion of online list coloring to signed graphs. We define the online list chromatic number of a signed graph, and prove a generalization of Brooks’ Theorem.
White, Jacob A., Tupper, Melissa
core +1 more source
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Between coloring and list-coloring: μ-coloring [PDF]
, 2011 A new variation of the coloring problem, mu-coloring, is defined in this paper. A coloring of a graph G = (V,E) is a function f: V -> N such that f(v) is different from f(w) if v is adjacent to w.
Cecowski Palacio, Mariano +1 more
core
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
Generalized Sum List Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2019 A (graph) property 𝒫 is a class of simple finite graphs closed under isomorphisms. In this paper we consider generalizations of sum list colorings of graphs with respect to properties 𝒫.
Kemnitz Arnfried +2 more
doaj +1 more source
2-Distance List (Δ+3) -Coloring of Sparse Graphs
, 2022 International audienceA 2-distance list k-coloring of a graph is a proper coloring of the vertices where each vertex has a list of at least k available colors and vertices at distance at most 2 cannot share the same color.
La, Xuan Hoang
core +1 more source
Subtype‐specific enhancer RNAs define transcriptional regulators and prognosis in breast cancers
Molecular Oncology, EarlyView.This study employed machine learning methodologies to perform the subtype‐specific classification of RNA‐seq data sets, which are mapped on enhancers from TCGA‐derived breast cancer patients. Their integration with gene expression (referred to as ProxCReAM eRNAs) and chromatin accessibility profiles has the potential to identify lineage‐specific and ...
Aamena Y. Patel +6 more
wiley +1 more source
Maximum average degree of list-edge-critical graphs and Vizing's conjecture
Electronic Journal of Graph Theory and Applications, 2022 Vizing conjectured that χ′ℓ(G)≤Δ + 1 for all graphs. For a graph G and nonnegative integer k, we say G is a k-list-edge-critical graph if χ′ℓ(G)>k, but χ′ℓ(G − e)≤k for all e ∈ E(G).
Joshua Harrelson, Hannah Reavis
doaj +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source