Oriented colourings of graphs with maximum degree three and four - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2019

Oriented colourings of graphs with maximum degree three and four

Résumé

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.

Dates et versions

hal-02264646 , version 1 (07-08-2019)

Identifiants

Citer

Christopher Duffy, Gary Macgillivray, Eric Sopena. Oriented colourings of graphs with maximum degree three and four. Discrete Mathematics, 2019, 342 (4), pp.959-974. ⟨10.1016/j.disc.2018.10.008⟩. ⟨hal-02264646⟩

Collections

CNRS TDS-MACS
12 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More