Complexity of Grundy coloring and its variants

Abstract : The Grundy number of a graph is the maximum number of colors used by the greedy coloring algorithm over all vertex orderings. In this paper, we study the computational complexity of Grundy Coloring, the problem of determining whether a given graph has Grundy number at least . We also study the variants Weak Grundy Coloring (where the coloring is not necessarily proper) and Connected Grundy Coloring (where at each step of the greedy coloring algorithm, the subgraph induced by the colored vertices must be connected).
Document type :
Journal articles
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02104874
Contributor : Christine Okret-Manville <>
Submitted on : Friday, April 19, 2019 - 5:11:28 PM
Last modification on : Monday, January 20, 2020 - 12:12:06 PM

File

155324384491958.pdf
Files produced by the author(s)

Identifiers

Citation

Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora. Complexity of Grundy coloring and its variants. Discrete Applied Mathematics, Elsevier, 2018, 243, ⟨10.1016/j.dam.2017.12.022⟩. ⟨hal-02104874⟩

Share

Metrics

Record views

76

Files downloads

140