Oriented colourings of graphs with maximum degree three and four

DOI10.1016/j.disc.2018.10.008zbMath1405.05056arXiv1812.05510OpenAlexW2904851722MaRDI QIDQ1727768

Christopher Duffy, Gary MacGillivray, Eric Sopena

Publication date: 20 February 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.05510

zbMATH Keywords

oriented graph colouringoriented graph homomorphism

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Coloring graphs in oriented coloring of cubic graphs, Equitable oriented coloring, Pushable chromatic number of graphs with degree constraints, Efficient computation of the oriented chromatic number of recursively defined digraphs, Oriented cliques and colorings of graphs with low maximum degree, Chromatic polynomials of oriented graphs, Colourings of oriented connected cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Homomorphisms and colourings of oriented graphs: an updated survey
• Oriented vertex and arc colorings of outerplanar graphs
• On the oriented chromatic number of grids
• Good and semi-strong colorings of oriented planar graphs
• The oriented chromatic number of Halin graphs
• Analogues of cliques for \((m,n)\)-colored mixed graphs
• On an adjacency property of almost all tournaments
• Acyclic and oriented chromatic numbers of graphs
• Paley graphs satisfy all first-order adjacency axioms
• The chromatic number of oriented graphs
• Analogues of cliques for oriented coloring
• A Constructive Solution to a Tournament Problem
• Acyclic colorings of planar graphs