Results 51 to 60 of about 934,158 (291)
Locally irregular edge-coloring of subcubic graphs [PDF]
, 2022 A graph is {\em locally irregular} if no two adjacent vertices have the same degree. A {\em locally irregular edge-coloring} of a graph $G$ is such an (improper) edge-coloring that the edges of any fixed color induce a locally irregular graph.
Maceková, Mária +5 more
core +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem [PDF]
, 2004 A nearly equitable edge-coloring of a multigraph is a coloring such that edges incident to each vertex are colored equitably in number. This problem was solved in O(kn^2) time, where n and k are the numbers of the edges and the colors, respectively.
XIE, Xuzhen +3 more
core
Majority distinguishing edge coloring
, 2023 We consider edge colorings of graphs. An edge coloring is a majority coloring if for every vertex at most half of the edges incident with it are in one color.
Prorok, Magdalena +1 more
core
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +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
FEBS Letters, EarlyView.Ascidian Ciona larvae initially show strong clockwise tail twisting, which is largely corrected during development. However, a small residual twist remains. This study shows that organized helical myofibrils in tail muscles mechanically stabilize this residual asymmetry, preventing complete restoration of bilateral symmetry and revealing how embryos ...
Yuki S. Kogure +3 more
wiley +1 more source
Degradation mechanism of the von Willebrand factor A2 domain by nattokinase
FEBS Letters, EarlyView.Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto +3 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
Ars Mathematica Contemporanea, 2015 An edge coloring of a graph G is said to be an odd edge coloring if for each vertex v ofG and each colorc, the vertexv uses the colorc an odd number of times or does not use it at all. In [5], Pyber proved that 4 colors suffice for an odd edge coloring of any simple graph.
Borut Luzar +2 more
openaire +4 more sources