2 citations · 4 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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.DM2019
A Note on Colourings of Connected Oriented Cubic Graphs
Christopher Duffy
In this note we show every orientation of a connected cubic graph admits an oriented 8-colouring. This lowers the best-known upper bound for the chromatic number of the family of o…