Results 81 to 90 of about 1,522,114 (310)
Note on list star edge‐coloring of subcubic graphs [PDF]
Journal of Graph Theory, 2017 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
Revisiting semistrong edge‐coloring of graphs
Journal of Graph Theory, 2023 AbstractA matching in a graph is semistrong if every edge of has an endvertex of degree one in the subgraph induced by the vertices of . A semistrong edge‐coloring of a graph is a proper edge‐coloring in which every color class induces a semistrong matching.
Borut Lužar +2 more
openaire +2 more sources
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
Animation Visualization for Vertex Coloring of Polyhedral Graphs [PDF]
Journal of Systemics, Cybernetics and Informatics, 2013 Vertex coloring of a graph is the assignment of labels to the vertices of the graph so that adjacent vertices have different labels. In the case of polyhedral graphs, the chromatic number is 2, 3, or 4. Edge coloring problem and face coloring problem can
Hidetoshi Nonaka
doaj
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
List star edge coloring of k-degenerate graphs
Discrete Mathematics, 2019 A star edge coloring of a graph is a proper edge coloring such that every connected 2-colored subgraph is a path with at most 3 edges. Deng et al. and Bezegova et al.
Miaomiao Han +3 more
semanticscholar +1 more source
Edge‐coloring linear hypergraphs with medium‐sized edges [PDF]
Random Struct. Algorithms, 2017 Motivated by the Erdos̋‐Faber‐Lovász (EFL) conjecture for hypergraphs, we consider the list edge coloring of linear hypergraphs. We show that if the hyper‐edge sizes are bounded between i and Ci,ϵn inclusive, then there is a list edge coloring using (1+ϵ)
V. Faber, David G. Harris
semanticscholar +1 more source
Degenerate matchings and edge colorings [PDF]
Discrete Applied Mathematics, 2018 A matching $M$ in a graph $G$ is $r$-degenerate if the subgraph of $G$ induced by the set of vertices incident with an edge in $M$ is $r$-degenerate. Goddard, Hedetniemi, Hedetniemi, and Laskar (Generalized subgraph-restricted matchings in graphs, Discrete Mathematics 293 (2005) 129-138) introduced the notion of acyclic matchings, which coincide with ...
Baste, Julien, Rautenbach, Dieter
openaire +3 more sources
FEBS Letters, EarlyView.This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel +13 more
wiley +1 more source
Distributed Degree Splitting, Edge Coloring, and Orientations [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2016 We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node's degree is split almost uniformly.
M. Ghaffari, Hsin-Hao Su
semanticscholar +1 more source