Results 31 to 40 of about 29,700 (214)

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

open access: yes, 2012
A conjecture of Erd\H{o}s, Gy\'arf\'as, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been proven only for r
Alexey Pokrovskiy   +10 more
core   +1 more source

Connectedness of the graph of vertex-colourings [PDF]

open access: yesDiscrete Mathematics, 2008
For a positive integer k and a graph G, the k-colour graph of G, C"k(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joined by an edge in C"k(G) if they differ in colour on just one vertex of G. In this note some results on the connectedness of C"k(G) are proved.
Cereceda, L.   +2 more
openaire   +3 more sources

miRNA‐29 regulates epidermal and mesenchymal functions in skin repair

open access: yesFEBS Letters, EarlyView.
miRNA‐29 inhibits cell‐to‐cell and cell‐to‐matrix adhesion by silencing mRNA targets. Adhesion is controlled by complex interactions between many types of molecules coded by mRNAs. This is crucial for keeping together the layers of the skin and for regenerating the skin after wounding.
Lalitha Thiagarajan   +10 more
wiley   +1 more source

Ion channel function of polycystin‐2/polycystin‐1 heteromer revealed by structure‐guided mutagenesis

open access: yesFEBS Letters, EarlyView.
Mutations in polycystin‐1 (PC1) or polycystin‐2 (PC2) cause autosomal‐dominant polycystic kidney disease (ADPKD). We generated a novel gain‐of‐function PC2/PC1 heteromeric ion channel by mutating pore‐blocking residues. Moreover, we demonstrated that PC2 will preferentially assemble with PC1 to form heteromeric complexes when PC1 is co‐expressed ...
Tobias Staudner   +7 more
wiley   +1 more source

Graph colourings and partitions

open access: yesTheoretical Computer Science, 2001
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz., the chromatic number, the achromatic number and the pseudoachromatic number. The importance of their study in connection with the computational complexity, partitions, algebra, projective plane geometry and analysis were briefly surveyed.
openaire   +2 more sources

Disruption of SETD3‐mediated histidine‐73 methylation by the BWCFF‐associated β‐actin G74S mutation

open access: yesFEBS Letters, EarlyView.
The β‐actin G74S mutation causes altered interaction of actin with SETD3, reducing histidine‐73 methylation efficiency and forming two distinct actin variants. The variable ratio of these variants across cell types and developmental stages contributes to tissue‐specific phenotypical changes. This imbalance may impair actin dynamics and mechanosensitive
Anja Marquardt   +8 more
wiley   +1 more source

H-colouring bipartite graphs

open access: yesJournal of Combinatorial Theory, Series B, 2012
27 pages, small revisions from previous version, this version appears in Journal of Combinatorial Theory Series ...
Engbers, John, Galvin, David
openaire   +3 more sources

Approximate Graph Colouring and Crystals

open access: yes, 2023
Full version of a SODA 2023 ...
Ciardo, L, Živný, S
openaire   +2 more sources

Cellular liquid biopsy provides unique chances for disease monitoring, preclinical model generation and therapy adjustment in rare salivary gland cancer patients

open access: yesMolecular Oncology, EarlyView.
We quantified and cultured circulating tumor cells (CTCs) of 62 patients with various cancer types and generated CTC‐derived tumoroid models from two salivary gland cancer patients. Cellular liquid biopsy‐derived information enabled molecular genetic assessment of systemic disease heterogeneity and functional testing for therapy selection in both ...
Nataša Stojanović Gužvić   +31 more
wiley   +1 more source

Flip colouring of graphs

open access: yesGraphs and Combinatorics
Abstract It is proved that for integers b, r such that $$3 \le b < r \le \left( {\begin{array}{c}b+1\\ 2\end{array}}\right) - 1$$ 3 ≤ b < r ≤
Yair Caro   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy