Results 81 to 90 of about 1,425,497 (376)
FEBS Letters, EarlyView.Phytohormone brassinosteroid‐induced gene regulation by the transcription factor BIL1/BZR1 involves redox‐dependent DNA‐binding alternation and interaction with the transcription factor PIF4. The reduced BIL1/BZR1 dimer binds preferred cis‐elements, while oxidation alters its oligomerization state and disrupts DNA‐binding ability.
Shohei Nosaki +4 more
wiley +1 more source
Acyclic edge coloring of planar graphs
AIMS Mathematics, 2022 An acyclic edge coloring of a graph $ G $ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of $ G $, denoted by $ \chi^{'}_{a}(G) $, is the smallest integer $ k $ such that $ G $ is acyclically edge $ k $
Yuehua Bu +3 more
doaj +1 more source
On the simultaneous edge-coloring conjecture
Discrete Mathematics, 2000 Let \(S = \{s_1,\dots, s_m, t_1,\dots, t_n\}\) be a positive integer sequence. The sequence \(S\) is called a bipartite graphic sequence if there is a bipartite graph \(G\) with bipartition \(\{ X, Y \}\) such that \(\{ d(x_1) , \dots , d(x_m) \} = \{ s_1, \dots , s_m \},\) and \(\{ d(y_1) , \dots , d(y_n) \} = \{ t_1, \dots , t_n \}\) where \(X ...
Ebadollah S. Mahmoodian +4 more
openaire +3 more sources
Approximate constrained bipartite edge coloring [PDF]
Discrete Applied Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Caragiannis, Ioannis +5 more
openaire +6 more sources
Structural dynamics of the plant hormone receptor ETR1 in a native‐like membrane environment
FEBS Letters, EarlyView.The present study unveils the structural and signaling dynamics of ETR1, a key plant ethylene receptor. Using an optimized nanodisc system and solution NMR, we captured full‐length ETR1 in a native‐like membrane environment. Our findings reveal dynamic domain uncoupling and Cu(I)‐induced rigidification, providing the first evidence of metal‐triggered ...
Moritz Lemke +2 more
wiley +1 more source
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence [PDF]
, 2010 We study the {edge-coloring} problem in the message-passing model of distributed computing. This is one of the most fundamental and well-studied problems in this area.
Barenboim, Leonid, Elkin, Michael
core
Algorithmica, 2016 A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to at least one vertex in each other color class. The b-chromatic number of $G$ is the maximum integer $b(G)$ for which $G$ has a b-coloring with $b(G)$ colors.
Victor Campos, FERREIRA DA SILVA A
openaire +3 more sources
FEBS Letters, EarlyView.Single‐cell RNA sequencing reveals an opposite role of SLPI in basal tumors based on metastatic spread, along with shared activation of specific regulons in cancer cells and mature luminal lactocytes, as well as downregulation of MALAT1 and NEAT1 in the latter.
Pietro Ancona +4 more
wiley +1 more source
M2-Edge Colorings Of Cacti And Graph Joins
Discussiones Mathematicae Graph Theory, 2016 An edge coloring φ of a graph G is called an M2-edge coloring if |φ(v)| ≤ 2 for every vertex v of G, where φ(v) is the set of colors of edges incident with v. Let 𝒦2(G) denote the maximum number of colors used in an M2-edge coloring of G.
Czap Július +2 more
doaj +1 more source
On The Local Edge Antimagic Coloring of Corona Product of Path and Cycle
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2019 Let be a nontrivial and connected graph of vertex set and edge set . A bijection is called a local edge antimagic labeling if for any two adjacent edges and , where for . Thus, the local edge antimagic labeling induces a proper edge coloring of G if
Siti Aisyah +4 more
doaj +1 more source