Results 111 to 120 of about 1,425,497 (376)
Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs [PDF]
AbstractIt is conjectured that every edge‐colored complete graph on vertices satisfying contains vertex‐disjoint properly edge‐colored cycles. We confirm this conjecture for , prove several additional weaker results for general , and we establish structural properties of possible minimum counterexamples to the conjecture.
Ruonan Li, Hajo Broersma, Shenggui Zhang
openaire +4 more sources
Integrating ancestry, differential methylation analysis, and machine learning, we identified robust epigenetic signature genes (ESGs) and Core‐ESGs in Black and White women with endometrial cancer. Core‐ESGs (namely APOBEC1 and PLEKHG5) methylation levels were significantly associated with survival, with tumors from high African ancestry (THA) showing ...
Huma Asif, J. Julie Kim
wiley +1 more source
New Concepts on Vertex and Edge Coloring of Simple Vague Graphs
The vague graph has found its importance as a closer approximation to real life situations. A review of the literature in this area reveals that the edge coloring problem for vague graphs has not been studied until now.
Arindam Dey +4 more
semanticscholar +1 more source
Note on list star edge‐coloring of subcubic graphs [PDF]
A star edge‐coloring of a graph is a proper edge‐coloring without bichromatic paths and cycles of length four. In this paper, we consider the list version of this coloring and prove that the list star chromatic index of every subcubic graph is at most 7,
Borut Lužar +2 more
semanticscholar +1 more source
Loss of the frequently mutated chromatin remodeler ARID1A, a subunit of the SWI/SNF cBAF complex, results in less open chromatin, alternative splicing, and the failure to stop cells from progressing through the cell cycle after DNA damage in bladder (cancer) cells. Created in BioRender. Epigenetic regulators, such as the SWI/SNF complex, with important
Rebecca M. Schlösser +11 more
wiley +1 more source
The min-max edge q-coloring problem [PDF]
In this paper we introduce and study a new problem named \emph{min-max edge $q$-coloring} which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer $q$.
Larjomaa, Tommi, Popa, Alexandru
core
List Star Edge-Coloring of Subcubic Graphs
A star edge-coloring of a graph G is a proper edge coloring such that every 2-colored connected subgraph of G is a path of length at most 3. For a graph G, let the list star chromatic index of G, ch′st(G), be the minimum k such that for any k-uniform ...
Samia Kerdjoudj +2 more
semanticscholar +1 more source
Kernels in edge-colored digraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
This study investigates gene expression differences between two major pediatric acute lymphoblastic leukemia (ALL) subtypes, B‐cell precursor ALL, and T‐cell ALL, using a data‐driven approach consisting of biostatistics and machine learning methods. Following analysis of a discovery dataset, we find a set of 14 expression markers differentiating the ...
Mona Nourbakhsh +8 more
wiley +1 more source
Antipodal Edge-Colorings of Hypercubes
Two vertices of the k-dimensional hypercube Qkare antipodal if they differ in every coordinate. Edges uv and xy are antipodal if u is antipodal to x and v is antipodal to y.
West Douglas B., Wise Jennifer I.
doaj +1 more source

