Richard C. Brewster

From MaRDI portal
Person:301585

Available identifiers

zbMath Open brewster.richard-cMaRDI QIDQ301585

List of research outcomes





PublicationDate of PublicationType
Min orderings and list homomorphism dichotomies for graphs and signed graphs2024-08-02Paper
Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$2023-10-06Paper
Min orderings and list homomorphism dichotomies for signed and unsigned graphs2023-07-26Paper
List homomorphisms to separable signed graphs2023-06-10Paper
A dichotomy theorem for $\Gamma$-switchable $H$-colouring on $m$-edge coloured graphs2023-06-09Paper
The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial2023-05-31Paper
The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets2023-05-28Paper
List homomorphisms to separable signed graphs2023-05-08Paper
The $i$-Graphs of Paths and Cycles2023-03-14Paper
Reconfiguration of Minimum Independent Dominating Sets in Graphs2023-03-10Paper
List homomorphism problems for signed trees2023-01-17Paper
Edge-coloured graph homomorphisms, paths, and duality2022-08-25Paper
https://portal.mardi4nfdi.de/entity/Q50891812022-07-18Paper
Graph homomorphism reconfiguration and frozen H‐colorings2022-03-31Paper
https://portal.mardi4nfdi.de/entity/Q49953222021-06-23Paper
Reconfiguration of homomorphisms to reflexive digraph cycles2021-06-14Paper
List homomorphism problems for signed trees2020-05-12Paper
Broadcast domination and multipacking: bounds and the integrality gap2019-09-19Paper
On the multipacking number of grid graphs2019-08-01Paper
Broadcast domination and multipacking in strongly chordal graphs2019-05-17Paper
A complexity dichotomy for signed \(\mathbf{H}\)-colouring2018-08-15Paper
Recolouring reflexive digraphs2018-04-19Paper
The complexity of signed graph and edge-coloured graph homomorphisms2016-12-14Paper
https://portal.mardi4nfdi.de/entity/Q57407902016-07-20Paper
On homomorphisms to edge-coloured cycles2016-07-01Paper
A dichotomy theorem for circular colouring reconfiguration2016-06-30Paper
Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings2016-02-01Paper
Factors with Multiple Degree Constraints in Graphs2014-04-10Paper
New bounds for the broadcast domination number of a graph2013-06-14Paper
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs2012-09-12Paper
Lexicographic products with high reconstruction numbers2012-05-30Paper
Extending precolourings of circular cliques2012-01-11Paper
The circular chromatic number of hypergraphs2009-12-15Paper
Edge-switching homomorphisms of edge-coloured graphs2009-12-15Paper
Near-Unanimity Functions and Varieties of Reflexive Graphs2009-08-20Paper
On the complexity of digraph packings2009-03-23Paper
On the restricted homomorphism problem2008-10-17Paper
Oriented star packings2008-04-28Paper
https://portal.mardi4nfdi.de/entity/Q54476922008-03-20Paper
Building blocks for the variety of absolute retracts2006-09-13Paper
The recognition of bound quivers using edge-coloured homomorphisms2005-09-22Paper
https://portal.mardi4nfdi.de/entity/Q54614652005-07-26Paper
Packing paths in digraphs2003-10-29Paper
Homomorphisms to powers of digraphs2002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q42117391999-03-02Paper
The complexity of restricted graph homomorphisms1997-10-09Paper
Homomorphically full graphs1996-07-07Paper
The complexity of colouring symmetric relational systems1995-04-09Paper
A note on restricted \(H\)-colouring1992-06-28Paper
THE IRREDUNDANT RAMSEY NUMBER s(3,6)1990-01-01Paper
Irredundant ramsey numbers for graphs1989-01-01Paper
Irredundant ramsey numbers for graphs1989-01-01Paper

Research outcomes over time

This page was built for person: Richard C. Brewster