Résumé | A complete k-colouring of an undirected graph G is a proper k-colouring of the vertices of G such that, for every pair of colours {a,b}, there is an edge in G whose endponts are coloured with a and b. The achromatic number of G is then the largest k for which G admits a complete k-colouring.
In this talk, we will study complete colourings of oriented graphs and the associated new notion of the oriented achromatic number. |