The following pages link to Richard C. Brewster (Q301585):
Displayed 50 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Lexicographic products with high reconstruction numbers (Q418863) (← links)
- Extending precolourings of circular cliques (Q658016) (← links)
- On the restricted homomorphism problem (Q948709) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- Edge-switching homomorphisms of edge-coloured graphs (Q1045035) (← links)
- The circular chromatic number of hypergraphs (Q1045069) (← links)
- Item:Q301585 (redirect page) (← links)
- A note on restricted \(H\)-colouring (Q1183461) (← links)
- The complexity of colouring symmetric relational systems (Q1327221) (← links)
- Homomorphisms to powers of digraphs (Q1349073) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
- Recolouring reflexive digraphs (Q1744757) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- New bounds for the broadcast domination number of a graph (Q1955610) (← links)
- Reconfiguration of homomorphisms to reflexive digraph cycles (Q2032862) (← links)
- List homomorphism problems for signed trees (Q2111917) (← links)
- The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- Oriented star packings (Q2483479) (← links)
- Building blocks for the variety of absolute retracts (Q2502901) (← links)
- The recognition of bound quivers using edge-coloured homomorphisms (Q2566139) (← links)
- (Q2816064) (← links)
- On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs (Q2911062) (← links)
- Irredundant ramsey numbers for graphs (Q3033791) (← links)
- Near-Unanimity Functions and Varieties of Reflexive Graphs (Q3393427) (← links)
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
- THE IRREDUNDANT RAMSEY NUMBER s(3,6) (Q3487385) (← links)
- Irredundant ramsey numbers for graphs (Q4204177) (← links)
- (Q4211739) (← links)
- Packing paths in digraphs (Q4432768) (← links)
- (Q4995322) (← links)
- Graph homomorphism reconfiguration and frozen H‐colorings (Q5066895) (← links)
- (Q5089181) (← links)
- Broadcast domination and multipacking: bounds and the integrality gap (Q5197586) (← links)
- On the multipacking number of grid graphs (Q5226844) (← links)
- Factors with Multiple Degree Constraints in Graphs (Q5408588) (← links)
- (Q5447692) (← links)
- (Q5461465) (← links)
- (Q5740790) (← links)
- The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial (Q6045448) (← links)
- Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ (Q6093150) (← links)
- List homomorphisms to separable signed graphs (Q6102261) (← links)
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs (Q6109028) (← links)
- List homomorphism problems for signed trees (Q6340513) (← links)
- Edge-coloured graph homomorphisms, paths, and duality (Q6408841) (← links)
- Reconfiguration of Minimum Independent Dominating Sets in Graphs (Q6429176) (← links)
- The $i$-Graphs of Paths and Cycles (Q6429598) (← links)
- The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets (Q6438279) (← links)
