Results 51 to 60 of about 4,584 (263)
On the neighbour sum distinguishing index of planar graphs
, 2016 Let $c$ be a proper edge colouring of a graph $G=(V,E)$ with integers $1,2,\ldots,k$. Then $k\geq \Delta(G)$, while by Vizing's theorem, no more than $k=\Delta(G)+1$ is necessary for constructing such $c$. On the course of investigating irregularities in
Bonamy, Marthe, Przybyło, Jakub
core +2 more sources
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
FEBS Letters, EarlyView.Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley +1 more source
Two conjectures on edge-colouring
Discrete Mathematics, 1989 A simple graph G is said to be Class 1 (resp. Class 2) if \(\chi'(G)=\Delta(G)\) (resp. \(\chi'(G)=\Delta(G)+1)\) where \(\chi'(G)\) is the chromatic index of G and \(\Delta(G)\) is the maximum degree of G. If G satisfies the inequality \(| E(G)| >\Delta (G)[| V(G)|],\) then G is said to be overfull. A. G.
openaire +1 more source
Multiple ETS family transcription factors bind mutant p53 via distinct interaction regions
FEBS Letters, EarlyView.Mutant p53 gain‐of‐function is thought to be mediated by interaction with other transcription factors. We identify multiple ETS transcription factors that can bind mutant p53 and found that this interaction can be promoted by a PXXPP motif. ETS proteins that strongly bound mutant p53 were upregulated in ovarian cancer compared to ETS proteins that ...
Stephanie A. Metcalf +6 more
wiley +1 more source
Applications of Edge Colouring of Fuzzy Graphs [PDF]
Informatica, 2020 Summary: Colouring of graphs is being used in several representations of real world systems like map colouring, traffic signalling, etc. This study introduces the edge colouring of fuzzy graphs. The chromatic index and the strong chromatic index are defined and related properties are investigated.
Mahapatra, Rupkumar +2 more
openaire +1 more source
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
FEBS Letters, EarlyView.We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka +11 more
wiley +1 more source
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Representing branched coverings by Edge-Coloured Graphs
Topology and its Applications, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CASALI, Maria Rita, GRASSELLI, Luigi
openaire +3 more sources
FEBS Letters, EarlyView.Bone metastasis in prostate cancer (PCa) patients is a clinical hurdle due to the poor understanding of the supportive bone microenvironment. Here, we identify stearoyl‐CoA desaturase (SCD) as a tumor‐promoting enzyme and potential therapeutic target in bone metastatic PCa.
Alexis Wilson +7 more
wiley +1 more source
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A k-stack layout (respectively, k-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +2 more sources