A Note on Colourings of Connected 2-edge Coloured Cubic Graphs

10/24/2019

∙

by   Christopher Duffy, et al.

∙

0

∙

share

In this short note we show that every connected 2-edge coloured cubic graph admits an 10-colouring. This lowers the best known upper bound for the chromatic number of connected 2-edge coloured cubic graphs.