Oriented colourings of graphs with maximum degree three and four

Christopher Duffy,Gary MacGillivray,Éric Sopena

Discrete Mathematics（2019）

引用 6|浏览1

暂无评分

摘要

We show that any orientation of a graph with maximum degree three has an oriented 9-colouring, and that any orientation of a graph with maximum degree four has an oriented 69-colouring. These results improve the best known upper bounds of 11 and 80, respectively.

查看译文

关键词

Oriented graph colouring,Oriented graph homomorphism

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要