Brewster, Richard C.; Moore, Benjamin Characterizing circular colouring mixing for \(\frac{p}{q}< 4\). (English) Zbl 1522.05098 J. Graph Theory 102, No. 2, 271-294 (2023). MSC: 05C15 05C10 05C60 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{B. Moore}, J. Graph Theory 102, No. 2, 271--294 (2023; Zbl 1522.05098) Full Text: DOI arXiv
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphism problems for signed trees. (English) Zbl 1506.05082 Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023). MSC: 05C22 05C05 68Q15 05C60 PDFBibTeX XMLCite \textit{J. Bok} et al., Discrete Math. 346, No. 3, Article ID 113257, 24 p. (2023; Zbl 1506.05082) Full Text: DOI
Bok, Jan; Brewster, Richard C.; Hell, Pavol; Jedličková, Nikola; Rafiey, Arash Min orderings and list homomorphism dichotomies for signed and unsigned graphs. (English) Zbl 07719364 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 510-526 (2022). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13568, 510--526 (2022; Zbl 07719364) Full Text: DOI arXiv
Brewster, Richard C.; Kidner, Arnott; MacGillivray, Gary The 2-colouring problem for \((m,n)\)-mixed graphs with switching is polynomial. (English) Zbl 1515.05063 Discrete Math. Theor. Comput. Sci. 24, No. 2, Paper No. 5, 12 p. (2022). Reviewer: Paola Bonacini (Catania) MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. Theor. Comput. Sci. 24, No. 2, Paper No. 5, 12 p. (2022; Zbl 1515.05063) Full Text: DOI arXiv
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphisms to separable signed graphs. (English) Zbl 07683160 Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 22-35 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 13179, 22--35 (2022; Zbl 07683160) Full Text: DOI
Bok, Jan; Brewster, Richard; Feder, Tomás; Hell, Pavol; Jedličková, Nikola List homomorphism problems for signed graphs. (English) Zbl 07559391 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 20, 14 p. (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bok} et al., LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 20, 14 p. (2020; Zbl 07559391) Full Text: DOI arXiv
Brewster, Richard C.; Siggers, Mark A complexity dichotomy for signed \(\mathbf{H}\)-colouring. (English) Zbl 1393.05108 Discrete Math. 341, No. 10, 2768-2773 (2018). MSC: 05C15 05C22 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{M. Siggers}, Discrete Math. 341, No. 10, 2768--2773 (2018; Zbl 1393.05108) Full Text: DOI
Brewster, Richard C.; Foucaud, Florent; Hell, Pavol; Naserasr, Reza The complexity of signed graph and edge-coloured graph homomorphisms. (English) Zbl 1351.05099 Discrete Math. 340, No. 2, 223-235 (2017). MSC: 05C22 05C15 05C60 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 340, No. 2, 223--235 (2017; Zbl 1351.05099) Full Text: DOI arXiv
Brewster, Richard C.; Noel, Jonathan A. Mixing homomorphisms, recolorings, and extending circular precolorings. (English) Zbl 1330.05060 J. Graph Theory 80, No. 3, 173-198 (2015). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{J. A. Noel}, J. Graph Theory 80, No. 3, 173--198 (2015; Zbl 1330.05060) Full Text: DOI arXiv Link
Brewster, Richard C.; Noel, Jonathan A. Extending precolourings of circular cliques. (English) Zbl 1238.05085 Discrete Math. 312, No. 1, 35-41 (2012). MSC: 05C15 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{J. A. Noel}, Discrete Math. 312, No. 1, 35--41 (2012; Zbl 1238.05085) Full Text: DOI
Brewster, Richard C.; MacGillivray, Gary; Shepherd, Laura The circular chromatic number of hypergraphs. (English) Zbl 1213.05067 Discrete Math. 309, No. 18, 5757-5765 (2009). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 309, No. 18, 5757--5765 (2009; Zbl 1213.05067) Full Text: DOI
Brewster, Richard C.; Graves, Timothy Edge-switching homomorphisms of edge-coloured graphs. (English) Zbl 1213.05066 Discrete Math. 309, No. 18, 5540-5546 (2009). MSC: 05C15 05C60 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{T. Graves}, Discrete Math. 309, No. 18, 5540--5546 (2009; Zbl 1213.05066) Full Text: DOI
Brewster, Richard C.; Graves, Timothy On the restricted homomorphism problem. (English) Zbl 1151.68042 Discrete Appl. Math. 156, No. 14, 2823-2826 (2008). MSC: 68R10 68Q25 05C20 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{T. Graves}, Discrete Appl. Math. 156, No. 14, 2823--2826 (2008; Zbl 1151.68042) Full Text: DOI
Brewster, Richard C.; Hell, Pavol; Rizzi, Romeo Oriented star packings. (English) Zbl 1139.05027 J. Comb. Theory, Ser. B 98, No. 3, 558-576 (2008). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., J. Comb. Theory, Ser. B 98, No. 3, 558--576 (2008; Zbl 1139.05027) Full Text: DOI
Brewster, Richard C.; MacGillivray, Gary Building blocks for the variety of absolute retracts. (English) Zbl 1098.05071 Discrete Math. 306, No. 15, 1758-1764 (2006). MSC: 05C78 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{G. MacGillivray}, Discrete Math. 306, No. 15, 1758--1764 (2006; Zbl 1098.05071) Full Text: DOI
Brewster, Richard C.; Dedić, Renato; Huard, François; Queen, Jeffery The recognition of bound quivers using edge-coloured homomorphisms. (English) Zbl 1070.05036 Discrete Math. 297, No. 1-3, 13-25 (2005). MSC: 05C15 68R10 05C20 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 297, No. 1--3, 13--25 (2005; Zbl 1070.05036) Full Text: DOI
Brewster, Richard C.; Rizzi, Romeo On the complexity of digraph packings. (English) Zbl 1173.68528 Inf. Process. Lett. 86, No. 2, 101-106 (2003). MSC: 68Q17 68R10 PDFBibTeX XMLCite \textit{R. C. Brewster} and \textit{R. Rizzi}, Inf. Process. Lett. 86, No. 2, 101--106 (2003; Zbl 1173.68528) Full Text: DOI
Brewster, Richard C.; Hell, Pavol; MacGillivray, Gary The complexity of restricted graph homomorphisms. (English) Zbl 0873.68167 Discrete Math. 167-168, 145-154 (1997). MSC: 68R10 68Q25 05C15 05C20 PDFBibTeX XMLCite \textit{R. C. Brewster} et al., Discrete Math. 167--168, 145--154 (1997; Zbl 0873.68167) Full Text: DOI
Brewster, Richard; MacGillivray, Gary Homomorphically full graphs. (English) Zbl 0856.05093 Discrete Appl. Math. 66, No. 1, 23-31 (1996). Reviewer: R.Bodendiek (Kiel) MSC: 05C99 05C75 PDFBibTeX XMLCite \textit{R. Brewster} and \textit{G. MacGillivray}, Discrete Appl. Math. 66, No. 1, 23--31 (1996; Zbl 0856.05093) Full Text: DOI
Brewster, Richard The complexity of colouring symmetric relational systems. (English) Zbl 0810.05025 Discrete Appl. Math. 49, No. 1-3, 95-105 (1994). Reviewer: J.Bang-Jensen (Odense) MSC: 05C15 08A02 68Q25 68R10 PDFBibTeX XMLCite \textit{R. Brewster}, Discrete Appl. Math. 49, No. 1--3, 95--105 (1994; Zbl 0810.05025) Full Text: DOI
Brewster, Richard; MacGillivray, Gary A note on restricted \(H\)-colouring. (English) Zbl 0761.05039 Inf. Process. Lett. 40, No. 3, 149-151 (1991). Reviewer: M.Kubale (Gdańsk) MSC: 05C15 68Q15 PDFBibTeX XMLCite \textit{R. Brewster} and \textit{G. MacGillivray}, Inf. Process. Lett. 40, No. 3, 149--151 (1991; Zbl 0761.05039) Full Text: DOI