2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2020★ 2 cited
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
Christopher Duffy, Fabien Jacques, Mickael Montassier +1
A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph to a 2-edge-colored graph is a mapping $φ: V(…
cs.DM2019
A Note on Colourings of Connected -edge Coloured Cubic Graphs
Christopher Duffy
In this short note we show that every connected -edge coloured cubic graph admits an -colouring. This lowers the best known upper bound for the chromatic number of connected…
cs.DM2018
Oriented Colourings of Graphs with Maximum Degree Three and Four
Christopher Duffy, Gary MacGillivray, Eric Sopena
We show that any orientation of a graph with maximum degree three has an oriented 9-colouring, and that any orientation of a graph with maximum degree four has an oriented 69-colou…