Results 51 to 60 of about 4,256 (307)
Colouring diamond-free graphs [PDF]
Journal of Computer and System Sciences, 2017 The Colouring problem is that of deciding, given a graph $G$ and an integer $k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five vertices, we classify the computational complexity of Colouring for $(\mbox{diamond},H)$-free graphs.
Konrad K. Dabrowski +2 more
openaire +5 more sources
FEBS Letters, EarlyView.The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 more
wiley +1 more source
The Balanced Decomposition Number of TK4 and Series-Parallel Graphs
Discussiones Mathematicae Graph Theory, 2013 A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, say red and blue, such that there is the same number of vertices in each colour. The balanced decomposition number f(G) of G is the minimum integer s with the
Fujita Shinya, Liu Henry
doaj +1 more source
The Achromatic Colouring Of Graphs
Electronic Notes in Discrete Mathematics, 2009 Abstract In this paper, we find out the achromatic number of Central graph of Banana Tree, Helm Graph and Web Graph.
K. Thilagavathi +2 more
openaire +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
On Colouring Point Visibility Graphs [PDF]
Discrete Applied Mathematics, 2017 In this paper we show that it can be decided in polynomial time whether or not the visibility graph of a given point set is 4-colourable, and such a 4-colouring, if it exists, can also be constructed in polynomial time. We show that the problem of deciding whether the visibility graph of a point set is 5-colourable, is NP-complete.
Ajit Arvind Diwan, Bodhayan Roy
openaire +3 more sources
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Algorithms, 2018 A k-colouring of a graph G with colours 1 , 2 , … , k is canonical with respect to an ordering π = v 1 , v 2 , … , v n of the vertices of G if adjacent vertices are assigned different colours and, for 1 ≤ c ≤ k
Ruth Haas, Gary MacGillivray
doaj +1 more source
Molecular Oncology, EarlyView.In this explorative study, the abundance of circular RNA molecules in bone marrow stem cells was found to be elevated in patients with high‐risk myelodysplastic neoplasms, and to be associated with an increased risk of progression to acute myeloid leukemia.
Eileen Wedge +17 more
wiley +1 more source
Periodic assignment and graph colouring [PDF]
, 1991 We analyse the problem of executing periodic operations on a minimum number of identical processors under different constraints. The analysis is based on a reformulation of the problem in terms of graph colouring.
Wessels, J Jaap +3 more
core +3 more sources