On cliques of signed and switchable signed graphs. - Julien Bensmail; Christopher Duffy 001; Sagnik Sen 001 (CoRR, 2014)

Limited Visibility Cops and Robbers. - Nancy E. Clarke; Danielle Cox; Christopher Duffy 001; Danny Dyer; Shannon L. Fitzpatrick; Margaret-Ellen Messinger (CoRR, 2017)

Analogues of Cliques for (m, n)-Colored Mixed Graphs. - Julien Bensmail; Christopher Duffy 001; Sagnik Sen 001 (Graphs Comb., 2017)

The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating. - Christopher Duffy 001; Jeannette C. M. Janssen (Internet Math., 2017)

The Simple Chromatic Number of (m, n)-Mixed Graphs. - Christopher Duffy 001; Jarrod Pas (CoRR, 2018)

The Spread of Voting Attitudes in Social Networks. - Jordan Barrett; Christopher Duffy 001; Richard J. Nowakowski (CoRR, 2018)

Complexity of locally-injective homomorphisms to tournaments. - Stefan Bard; Thomas Bellitto; Christopher Duffy 001; Gary MacGillivray; Feiran Yang 003 (Discret. Math. Theor. Comput. Sci., 2018)

A Variation on Chip-Firing: the diffusion game. - Christopher Duffy 001; Thomas F. Lidbetter; Margaret-Ellen Messinger; Richard J. Nowakowski (Discret. Math. Theor. Comput. Sci., 2018)

A Study of k-dipath Colourings of Oriented Graphs. - Christopher Duffy 001; Gary MacGillivray; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2018)

Strongly n-e.c. Graphs and Independent Distinguishing Labellings. - Christopher Duffy 001; Jeannette C. M. Janssen (WAW, 2019)

Chromatic Polynomials of Oriented Graphs. - Danielle Cox; Christopher Duffy 001 (Electron. J. Comb., 2019)

A Note on Colourings of Connected Oriented Cubic Graphs. - Christopher Duffy 001 (CoRR, 2019)

A Note on Colourings of Connected 2-edge Coloured Cubic Graphs. - Christopher Duffy 001 (CoRR, 2019)

Oriented colourings of graphs with maximum degree three and four. - Christopher Duffy 001; Gary MacGillivray; Éric Sopena (Discret. Math., 2019)

Oriented incidence colourings of digraphs. - Christopher Duffy 001; Gary MacGillivray; Pascal Ochem; André Raspaud (Discuss. Math. Graph Theory, 2019)

The Firefighter problem: Saving sets of vertices on cubic graphs. - Christopher Duffy 001; Gary MacGillivray (Networks, 2019)

Convex Hulls and Simple Colourings in Directed and $2$-edge-Coloured Graphs. - Christopher Duffy 001; Sonja Linghui Shan (CoRR, 2020)

Limited visibility Cops and Robber. - Nancy E. Clarke; Danielle Cox; Christopher Duffy 001; Danny Dyer; Shannon L. Fitzpatrick; Margaret-Ellen Messinger (Discret. Appl. Math., 2020)

Colourings of oriented connected cubic graphs. - Christopher Duffy 001 (Discret. Math., 2020)

On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets. - Christopher Duffy 001; Sonja Linghui Shan (Discret. Math. Theor. Comput. Sci., 2021)

Chromatic Polynomials of 2-Edge-Coloured Graphs. - Iain Beaton; Danielle Cox; Christopher Duffy 001; Nicole Zolkavich (Electron. J. Comb., 2023)

Quasi-Transitive Mixed Graphs and Undirected Squares of Oriented Graphs. - Christopher Duffy 001 (CoRR, 2023)

The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. - Christopher Duffy 001; Fabien Jacques; Mickaël Montassier; Alexandre Pinlou (Discret. Math., 2023)

Homomorphically Full Oriented Graphs. - Thomas Bellitto; Christopher Duffy 001; Gary MacGillivray (Discret. Math. Theor. Comput. Sci., 2023)

On deeply critical oriented cliques. - Christopher Duffy 001; Pavan P. D; Sandeep R. B.; Sagnik Sen 001 (J. Graph Theory, 2023)

An analogue of quasi-transitivity for edge-coloured graphs. - Christopher Duffy 001; Todd Mullen (Discuss. Math. Graph Theory, 2024)

Switching m-edge-coloured graphs using non-abelian groups. - Christopher Duffy 001; Gary MacGillivray; Ben Tremblay (Australas. J Comb., 2025)