Results 101 to 110 of about 39,087 (298)
Partitioning 3-colored complete graphs into three monochromatic cycles
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core
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
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
FEBS Open Bio, EarlyView.MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source
On the edge coloring of graph products [PDF]
International Journal of Mathematics and Mathematical Sciences, 2005 The edge chromatic number of G is the minimum number of colors required to color the edges of G in such a way that no two adjacent edges have the same color. We will determine a sufficient condition for a various graph products to be of class 1, namely, strong product, semistrong product, and special product.
openaire +2 more sources
Edge and total choosability of near-outerplanar graphs
, 2006 It is proved that, if G is a K4-minor-free graph with maximum degree ∆ ≥ 4, then G is totally (∆ + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ∆ + 1 colours, then every element can be coloured with a colour from ...
Woodall, DR, Hetherington, TJ
core
Annals of Clinical and Translational Neurology, EarlyView.Epigenetic reprogramming in hematopoietic stem and progenitor cells (HSPCs) and downstream myeloid cells, mediated by H3.3 downregulation and endogenous retroelement (ERE) overexpression, contributes to the progression of multiple sclerosis (MS). ABSTRACT Background Skewed myelopoiesis in the bone marrow has been identified as a key driver of multiple ...
Li‐Mei Xiao +6 more
wiley +1 more source
Orientable edge colorings of graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Considerable efforts have been dedicated to developing effective treatments for post‐stroke executive impairment (PSEI), among which repetitive transcranial magnetic stimulation (rTMS) has shown great potential. This study aimed to investigate the therapeutic effects of high‐frequency rTMS on working memory (WM) and response ...
Mengting Lao +6 more
wiley +1 more source
Clustering on k-edge-colored graphs [PDF]
, 2013 We study the Max k-colored clustering problem, where, given an edge-colored graph with k colors, we seek to color the vertices of the graph so as to find a clustering of the vertices maximizing the number (or the weight) of matched edges, i.e.
Paparas, D. +5 more
core +2 more sources
Edge Coloring of Bipartite Graphs with Constraints
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
PERSIANO, Giuseppe +2 more
openaire +3 more sources