Results 71 to 80 of about 4,584 (263)
Sparsity-Parameterised Dynamic Edge Colouring
, 2023 We study the edge-colouring problem, and give efficient algorithms where the number of colours is parameterised by the graph's arboricity, $α$. In a dynamic graph, subject to insertions and deletions, we give a deterministic algorithm that updates a proper $Δ+ O(α)$ edge~colouring in $\operatorname{poly}(\log n)$ amortized time.
Christiansen, Aleksander B. G. +2 more
openaire +5 more sources
Complexity of greedy edge-colouring [PDF]
Journal of the Brazilian Computer Society, 2015 The Grundy index of a graph G = (V, E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the Grundy index of a graph G = (V, E) is NP-hard for general graphs. We also show that this problem is polynomial-time solvable for caterpillars.
Havet, Frédéric +2 more
openaire +2 more sources
Anti-Ramsey numbers of small graphs [PDF]
, 2013 The anti-Ramsey number $AR(n,G$), for a graph $G$ and an integer $n\geq|V(G)|$, is defined to be the minimal integer $r$ such that in any edge-colouring of $K_n$ by at least $r$ colours there is a multicoloured copy of $G$, namely, a copy of $G$ whose ...
Bialostocki, Arie +2 more
core
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
Oriented Incidence Colourings of Digraphs
Discussiones Mathematicae Graph Theory, 2019 Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for digraphs and define the oriented incidence chromatic number.
Duffy Christopher +3 more
doaj +1 more source
Gerechte Designs with Rectangular Regions
, 2011 A \emph{gerechte framework} is a partition of an $n \times n$ array into $n$ regions of $n$ cells each. A \emph{realization} of a gerechte framework is a latin square of order $n$ with the property that when its cells are partitioned by the framework ...
Bailey +6 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
On the Palette Index of Complete Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2018 The palette of a vertex x of a graph G determined by a proper edge colouring φ of G is the set {φ(xy) : xy ∈ E(G)} and the diversity of φ is the number of different palettes determined by φ. The palette index of G is the minimum of diversities of φ taken
Horňák Mirko, Hudák Juraj
doaj +1 more source
Distance edge-colourings and matchings
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kang, Ross J., Manggala, Putra
openaire +2 more sources
A synthetic benzoxazine dimer derivative targets c‐Myc to inhibit colorectal cancer progression
Molecular Oncology, EarlyView.Benzoxazine dimer derivatives bind to the bHLH‐LZ region of c‐Myc, disrupting c‐Myc/MAX complexes, which are evaluated from SAR analysis. This increases ubiquitination and reduces cellular c‐Myc. Impairing DNA repair mechanisms is shown through proteomic analysis.
Nicharat Sriratanasak +8 more
wiley +1 more source