#### Filter Results:

- Full text PDF available (60)

#### Publication Year

1993

2017

- This year (9)
- Last 5 years (41)
- Last 10 years (67)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Luis Cereceda, Jan van den Heuvel, Matthew Johnson
- Discrete Mathematics
- 2008

For a positive integer k and a graph G, the k-colour graph of G, Ck(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 Ck(G) if they differ in colour on just one vertex of G. In this note some results on the connectivity of Ck(G) are proved. In particular it is shown that if G has… (More)

- Oliver Eickelberg, MXf . ROTH, +4 authors Lutz Henning Block
- The Journal of biological chemistry
- 1999

The glucocorticoid receptor (GR) is a ubiquitously expressed transcription factor present in most cell types. Upon ligand binding, the GR is activated and translocates into the nucleus where it transmits the anti-inflammatory actions of glucocorticoids. Here, we describe the ligand-independent activation of GR by the beta2-adrenergic receptor (beta2-AR)… (More)

- Matthew Johnson, Daniel Alistair East, Daniel P Mulvihill
- Current Biology
- 2014

The actin cytoskeleton executes a broad range of essential functions within a living cell. The dynamic nature of the actin polymer is modulated to facilitate specific cellular processes at discrete locations by actin-binding proteins (ABPs), including the formins and tropomyosins (Tms). Formins nucleate actin polymers, while Tms are conserved dimeric… (More)

- Luis Cereceda, Jan van den Heuvel, Matthew Johnson
- Journal of Graph Theory
- 2006

Given a 3-colourable graph G and two proper vertex 3-colourings α and β of G, consider the following question : is it possible to transform α into β by recolouring vertices of G one at a time, making sure that all intermediate colourings are proper 3-colourings? We prove that this question is answerable in polynomial time. We do so by characterising the… (More)

- Luis Cereceda, Jan van den Heuvel, Matthew Johnson
- Eur. J. Comb.
- 2007

For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the corresponding colourings differ on precisely one vertex of G. We consider the following question : given G, how easily can we decide whether or not C3(G) is connected? We show that the… (More)

- Neil A. Burton, Matthew Johnson, Philipp Antczak, Ashley Robinson, Peter A Lund
- Journal of molecular biology
- 2010

Understanding gene regulation and its adaptive significance requires not only a detailed knowledge of individual molecular interactions that give rise to changes in gene expression but also an overview of complete genetic networks and the ways in which components within them interact. Increasingly, such studies are being done using luminescent or… (More)

- Michael S. Malamas, Jim Erdei, +10 authors Albert J. Robichaud
- Journal of medicinal chemistry
- 2009

The identification of small molecule aminoimidazoles as potent and selective human beta-secretase inhibitors is reported. These analogues demonstrate low nannomolar potency for BACE1 in a FRET assay, exhibit comparable activity in a cell-based (ELISA) assay, and show >100x selectivity for the other structurally related aspartyl proteases BACE2, cathepsin D,… (More)

- Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
- Algorithmica
- 2014

The $$k$$ k -colouring reconfiguration problem asks whether, for a given graph $$G$$ G , two proper $$k$$ k -colourings $$\alpha $$ α and $$\beta $$ β of $$G$$ G , and a positive integer $$\ell $$ ℓ , there exists a sequence of at most $$\ell +1$$ ℓ + 1 proper $$k$$ k -colourings of $$G$$ G which starts with $$\alpha $$ α and ends with $$\beta $$ β and… (More)

- Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
- Journal of Graph Theory
- 2017

For a positive integer k, a k-colouring of a graph G = (V,E) is a mapping c : V → {1, 2, . . . , k} such that c(u) 6= c(v) whenever uv ∈ E. The COLOURING problem is to decide, for a given G and k, whether a k-colouring of G exists. If k is fixed (that is, it is not part of the input), we have the decision problem k-COLOURING instead. We survey known results… (More)

- Jan van den Heuvel, Matthew Johnson
- CAAN
- 2004