Results 61 to 70 of about 42,715 (280)
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
Few Long Lists for Edge Choosability of Planar Cubic Graphs [PDF]
, 2012 It is known that every loopless cubic graph is 4-edge choosable. We prove the following strengthened result. Let G be a planar cubic graph having b cut-edges. There exists a set F of at most 5b/2 edges of G with the following property. For any function
Goddyn, Luis, Spencer, Andrea
core
List-edge-colouring planar graphs with precoloured edges [PDF]
European Journal of Combinatorics, 2019 14 pages, 3 figures, 1 ...
Joshua Harrelson +2 more
openaire +2 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
On (k1A1, k2A2, k3A3)-Edge Colourings in Graphs and Generalized Jacobsthal Numbers
Annales Mathematicae SilesianaeIn this paper we introduce a new kind of generalized Jacobsthal numbers in a distance sense. We give the identities and matrix representations for them and their connections with the Fibonacci and the Pell numbers. We also describe the interpretations of
Piejko Krzysztof, Trojnar-Spelina Lucyna
doaj +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
On Vizing's edge colouring question
Journal of Combinatorial Theory, Series B, 2023 Soon after his 1964 seminal paper on edge colouring, Vizing asked the following question: can an optimal edge colouring be reached from any given proper edge colouring through a series of Kempe changes? We answer this question in the affirmative for triangle-free graphs.
Bonamy, Marthe +4 more
openaire +2 more sources
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Forum of Mathematics, SigmaA classical problem, due to Gerencsér and Gyárfás from 1967, asks how large a monochromatic connected component can we guarantee in any r-edge colouring of $K_n$ ?
Noga Alon +3 more
doaj +1 more source