A Note on Colourings of Connected $2$-edge Coloured Cubic Graphs (1910.11394v1)

Abstract: 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.