Results 61 to 70 of about 4,584 (263)

On (k1A1, k2A2, k3A3)-Edge Colourings in Graphs and Generalized Jacobsthal Numbers

open access: yesAnnales Mathematicae Silesianae
In 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

The power of many colours

open access: yesForum of Mathematics, Sigma
A 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

The (Glg)ABCs of cyanobacteria: modelling of glycogen synthesis and functional divergence of glycogen synthases in Synechocystis sp. PCC 6803

open access: yesFEBS 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

Edge-colourings of graphs [PDF]

open access: yes, 1984
All the results in this thesis are concerned with the classification of graphs by their chromatic class. We first extend earlier results of Fiorini and others to give a complete list of critical graphs of order at most ten. We give conditions for extending the edge-colouring of a nearly complete subgraph to the whole graph and use this result to prove ...
openaire   +1 more source

Distinguishing graphs by edge-colourings

open access: yesEuropean Journal of Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kalinowski, Rafał, Pilśniak, Monika
openaire   +1 more source

Few Long Lists for Edge Choosability of Planar Cubic Graphs [PDF]

open access: yes, 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  

Transferrin receptor 1‐mediated iron uptake supports thermogenic activation in human cervical‐derived adipocytes

open access: yesFEBS Letters, EarlyView.
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai   +9 more
wiley   +1 more source

Total Colourings of Direct Product Graphs

open access: yes, 2019
A graph is k-total colourable if there is an assignment of k different colours to the vertices and edges of the graph such that no two adjacent nor incident elements receive the same colour.
Janssen, Jeannette, MacKeigan, Kyle
core   +1 more source

The planar cell polarity protein Vangl2 interacts with the PDZ‐domains of Scribble but not with a unique PDZ‐like domain in Inturned

open access: yesFEBS Letters, EarlyView.
Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes   +4 more
wiley   +1 more source

Simultaneous edge-colourings

open access: yes
14 ...
Boyadzhiyska, Simona   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy