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

MaRDI QIDQ6327850zbMATH OpenFDO

Authors Christopher Duffy

Publication date 24 October 2019

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

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.

This page was built for publication: A Note on Colourings of Connected $2$-edge Coloured Cubic Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6327850)