List coloring digraphs

Abstract : The dichromatic number χ(D) of a digraph D is the least number k such that the vertex set of D can be partitioned into k parts each of which induces an acyclic subdigraph. Introduced by Neumann-Lara in 1982, this digraph invariant shares many properties with the usual chromatic number of graphs and can be seen as the natural analog of the graph chromatic number. In this paper, we study the list dichromatic number of digraphs, giving evidence that this notion generalizes the list chromatic number of graphs. We first prove that the list dichromatic number and the dichromatic number behave the same in many contexts, such as in small digraphs (by proving a directed version of Ohba's Conjecture), tournaments, and random digraphs. We then consider bipartite digraphs, and show that their list dichromatic number can be as large as Ω(log n). We finally give a Brooks-type upper bound on the list dichromatic number of digon-free digraphs.
Type de document :
Article dans une revue
Journal of Graph Theory, Wiley, 2018, 87 (4), pp.492-508. 〈10.1002/jgt.22170〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger
Contributeur : Julien Bensmail <>
Soumis le : vendredi 16 février 2018 - 17:05:43
Dernière modification le : mercredi 28 février 2018 - 10:22:56


Fichiers produits par l'(les) auteur(s)



Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le. List coloring digraphs. Journal of Graph Theory, Wiley, 2018, 87 (4), pp.492-508. 〈10.1002/jgt.22170〉. 〈hal-01711077〉



Consultations de la notice


Téléchargements de fichiers