Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard C. Brewster
Person information
- affiliation: Thompson Rivers University, Department of Mathematics and Statistics, Kamloops, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j35]Jan Bok
, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. Theor. Comput. Sci. 1001: 114580 (2024)- 2023
- [j34]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed trees. Discret. Math. 346(3): 113257 (2023) - [j33]Richard C. Brewster, Benjamin R. Moore:
Characterizing circular colouring mixing for p q 4 $\frac{p}{q}\lt 4$. J. Graph Theory 102(2): 271-294 (2023) - [i10]Richard C. Brewster, Arnott Kidner, Gary MacGillivray:
A dichotomy theorem for Γ-switchable H-colouring on m-edge coloured graphs. CoRR abs/2306.05962 (2023) - [i9]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphisms to separable signed graphs. CoRR abs/2306.06449 (2023) - 2022
- [j32]Richard C. Brewster, Arnott Kidner, Gary MacGillivray:
The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [c3]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphisms to Separable Signed Graphs. CALDAM 2022: 22-35 - [c2]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs. LATIN 2022: 510-526 - [i8]Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey:
Min orderings and list homomorphism dichotomies for signed and unsigned graphs. CoRR abs/2206.01068 (2022) - [i7]Kyle Booker, Richard C. Brewster:
Edge-coloured graph homomorphisms, paths, and duality. CoRR abs/2208.12326 (2022) - 2021
- [j31]Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers:
Reconfiguration of homomorphisms to reflexive digraph cycles. Discret. Math. 344(8): 112441 (2021) - 2020
- [j30]Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers:
Graph homomorphism reconfiguration and frozen H-colorings. J. Graph Theory 94(3): 398-420 (2020) - [c1]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List Homomorphism Problems for Signed Graphs. MFCS 2020: 20:1-20:14 - [i6]Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková:
List homomorphism problems for signed graphs. CoRR abs/2005.05547 (2020)
2010 – 2019
- 2019
- [j29]Laurent Beaudou, Richard C. Brewster, Florent Foucaud:
Broadcast domination and multipacking: bounds and the integrality gap. Australas. J Comb. 74: 86-97 (2019) - [j28]Richard C. Brewster, Gary MacGillivray, Feiran Yang:
Broadcast domination and multipacking in strongly chordal graphs. Discret. Appl. Math. 261: 108-118 (2019) - [j27]Laurent Beaudou, Richard C. Brewster:
On the multipacking number of grid graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [j26]Richard C. Brewster, Jae-Baek Lee, Mark H. Siggers:
Recolouring reflexive digraphs. Discret. Math. 341(6): 1708-1721 (2018) - [j25]Richard C. Brewster, Mark H. Siggers:
A complexity dichotomy for signed H-colouring. Discret. Math. 341(10): 2768-2773 (2018) - [i5]Laurent Beaudou, Rick C. Brewster:
On the multipacking number of grid graphs. CoRR abs/1803.09639 (2018) - 2017
- [j24]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340(2): 223-235 (2017) - [i4]Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers:
Graph Homomorphism Reconfiguration and Frozen H-Colourings. CoRR abs/1712.00200 (2017) - 2016
- [j23]Richard C. Brewster, Sean McGuinness, Benjamin R. Moore, Jonathan A. Noel:
A dichotomy theorem for circular colouring reconfiguration. Theor. Comput. Sci. 639: 1-13 (2016) - 2015
- [j22]Richard C. Brewster, Jonathan A. Noel:
Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings. J. Graph Theory 80(3): 173-198 (2015) - [i3]Richard C. Brewster, Sean McGuinness, Benjamin R. Moore, Jonathan A. Noel:
A Dichotomy Theorem for Circular Colouring Reconfiguration. CoRR abs/1508.05573 (2015) - [i2]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR abs/1510.05502 (2015) - 2014
- [i1]Richard C. Brewster, Jonathan A. Noel:
Mixing Homomorphisms, Recolourings, and Extending Circular Precolourings. CoRR abs/1412.3493 (2014) - 2013
- [j21]Richard C. Brewster, Sean McGuinness, Morten Hegner Nielsen:
Factors with Multiple Degree Constraints in Graphs. SIAM J. Discret. Math. 27(4): 1734-1747 (2013) - 2012
- [j20]Richard C. Brewster, Jonathan A. Noel:
Extending precolourings of circular cliques. Discret. Math. 312(1): 35-41 (2012) - [j19]Richard C. Brewster, Gena Hahn, Stacey Wynn Lamont, Chester Lipka:
Lexicographic products with high reconstruction numbers. Discret. Math. 312(10): 1638-1645 (2012) - [j18]Richard C. Brewster, Daryl Funk:
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs. J. Graph Theory 71(2): 182-191 (2012)
2000 – 2009
- 2009
- [j17]Richard C. Brewster, Timothy Graves:
Edge-switching homomorphisms of edge-coloured graphs. Discret. Math. 309(18): 5540-5546 (2009) - [j16]Richard C. Brewster, Gary MacGillivray, Laura Shepherd:
The circular chromatic number of hypergraphs. Discret. Math. 309(18): 5757-5765 (2009) - 2008
- [j15]Richard C. Brewster, Timothy Graves:
On the restricted homomorphism problem. Discret. Appl. Math. 156(14): 2823-2826 (2008) - [j14]Richard C. Brewster, Pavol Hell, Romeo Rizzi:
Oriented star packings. J. Comb. Theory B 98(3): 558-576 (2008) - [j13]Richard C. Brewster, Tomás Feder, Pavol Hell, Jing Huang, Gary MacGillivray:
Near-Unanimity Functions and Varieties of Reflexive Graphs. SIAM J. Discret. Math. 22(3): 938-960 (2008) - 2006
- [j12]Richard C. Brewster, Gary MacGillivray:
Building blocks for the variety of absolute retracts. Discret. Math. 306(15): 1758-1764 (2006) - 2005
- [j11]Richard C. Brewster, Renato Dedic, François Huard, Jeffery Queen:
The recognition of bound quivers using edge-coloured homomorphisms. Discret. Math. 297(1-3): 13-25 (2005) - 2003
- [j10]Richard C. Brewster, Romeo Rizzi:
On the complexity of digraph packings. Inf. Process. Lett. 86(2): 101-106 (2003) - [j9]Richard C. Brewster, Pavol Hell, Sarah H. Pantel, Romeo Rizzi, Anders Yeo:
Packing paths in digraphs. J. Graph Theory 44(2): 81-94 (2003) - 2002
- [j8]Richard C. Brewster, Pavol Hell:
Homomorphisms to powers of digraphs. Discret. Math. 244(1-3): 31-41 (2002) - 2001
- [j7]Richard C. Brewster, Gary MacGillivray:
Minimizing b + D and well covered graphs. Ars Comb. 61 (2001) - 2000
- [j6]Richard C. Brewster, Pavol Hell:
On homomorphisms to edge-coloured cycles. Electron. Notes Discret. Math. 5: 46-49 (2000)
1990 – 1999
- 1997
- [j5]Richard C. Brewster, Pavol Hell, Gary MacGillivray:
The complexity of restricted graph homomorphisms. Discret. Math. 167-168: 145-154 (1997) - 1996
- [j4]Richard C. Brewster, Gary MacGillivray:
Homomorphically Full Graphs. Discret. Appl. Math. 66(1): 23-31 (1996) - 1994
- [j3]Richard C. Brewster:
The Complexity of Colouring Symmetric Relational Systems. Discret. Appl. Math. 49(1-3): 95-105 (1994) - 1991
- [j2]Richard C. Brewster, Gary MacGillivray:
A Note on Restricted H-Colouring. Inf. Process. Lett. 40(3): 149-151 (1991)
1980 – 1989
- 1989
- [j1]Richard C. Brewster, Ernest J. Cockayne, Christina M. Mynhardt:
Irredundant ramsey numbers for graphs. J. Graph Theory 13(3): 283-290 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
