List coloring digraphs - Université Claude Bernard Lyon 1 Accéder directement au contenu
Article Dans Une Revue Journal of Graph Theory Année : 2018

List coloring digraphs

Résumé

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.
Fichier principal
Vignette du fichier
list-acyclic.pdf (367.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01711077 , version 1 (16-02-2018)

Identifiants

Citer

Julien Bensmail, Ararat Harutyunyan, Ngoc Khang Le. List coloring digraphs. Journal of Graph Theory, 2018, 87 (4), pp.492-508. ⟨10.1002/jgt.22170⟩. ⟨hal-01711077⟩
631 Consultations
509 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More