1 research outputs found
A Note on Colourings of Connected -edge Coloured Cubic Graphs
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 -edge coloured cubic graphs