Colourings of oriented connected cubic graphs
arxiv(2020)
摘要
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 orientations of connected cubic graphs. We further show that every such oriented graph admits a 2-dipath 7-colouring. These results imply that either the oriented chromatic number for the family of orientations of connected cubic graphs equals the 2-dipath chromatic number or the long-standing conjecture of Sopena (Sopena, 1997) regarding the chromatic number of orientations of connected cubic graphs is false.
更多查看译文
关键词
Oriented Graph,Homomorphism,Colouring
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要