Results 61 to 70 of about 641,529 (298)
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
Algorithmic Aspect of Edge-Coloring [PDF]
, 2007 Vizing的定理敘述一個簡單圖 $G$ 能使用 $Delta (G)+1$ 顏色做邊著色，$Delta (G)$ 為圖 $G$ 的度數。這立即引進了分類的問題─假如最少著色數 $chi '(G)=Delta (G)$，$G$ 為 class one;否則 $G$ 為 class two。本論文延伸了Vizing的定理，介紹一個新的想法，假如我們要對 $G$的一個邊做著色且這個邊在 $k$ 顏色下滿足未飽合條件，$k leq Delta (G)$，則這個邊可使用 $k$ 個顏色中的一個顏色做著色 ...
魏廷恩, Wei, Tin-En
core
Improved Streaming Edge Coloring [PDF]
Given a graph, an edge coloring assigns colors to edges so that no pairs of adjacent edges share the same color. We are interested in edge coloring algorithms under the W-streaming model.
Zhang, Tianyi +2 more
core +1 more source
Tight Lower Bounds for List Edge Coloring [PDF]
, 2018 The fastest algorithms for edge coloring run in time 2^m n^{O(1)}, where m and n are the number of edges and vertices of the input graph, respectively. For dense graphs, this bound becomes 2^{Theta(n^2)}.
Kowalik, Lukasz, Socala, Arkadiusz
core +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
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
A note on compact and compact circular edge-colorings of graphs
Discrete Mathematics & Theoretical Computer Science, 2008 In the paper we study two variants of edge-coloring of edge-weighted graphs, namely compact edge-coloring and circular compact edge-coloring. First, we discuss relations between these two coloring models.
Dariusz Dereniowski, Adam Nadolski
doaj
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
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
, 2011 Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core +1 more source
Maximal edge colorings of graphs
European Journal of CombinatoricsFor a graph $G$ of order $n$ a maximal edge coloring is a proper edge coloring with $χ'(K_n)$ colors such that adding any edge to $G$ in any color makes it improper. Meszka and Tyniec proved that for some values of the number of edges there are no graphs with a maximal edge coloring, while for some other values, they provided constructions of such ...
Sebastian Babinski, Andrzej Grzesik
openaire +6 more sources