Skip to Main content Skip to Navigation
Journal articles

Saving colors and Max Coloring: some fixed-parameter tractability results

Abstract : Max coloring is a well known generalization of the usual Min Coloring problem, widely studied from (standard) complexity and approximation viewpoints. Here, we tackle this problem under the framework of parameterized complexity. In particular, we first show to what extend the result of [3]-saving colors from the trivial bound of n on the chromatic number-extends to Max Coloring. Then we consider possible improvements of these results by considering the problem of saving colors/weight with respect to a better bound on the chromatic number. Finally, we consider the fixed parameterized tractability of Max Coloring in restricted graph classes under standard parameterization.
Document type :
Journal articles
Complete list of metadata
Contributor : Bruno Escoffier Connect in order to contact the contributor
Submitted on : Monday, November 19, 2018 - 2:59:05 PM
Last modification on : Sunday, June 26, 2022 - 2:36:05 AM
Long-term archiving on: : Wednesday, February 20, 2019 - 3:24:58 PM


Files produced by the author(s)



Bruno Escoffier. Saving colors and Max Coloring: some fixed-parameter tractability results. Theoretical Computer Science, Elsevier, 2019, 758, pp.30-41. ⟨10.1016/j.tcs.2018.08.002⟩. ⟨hal-01926891⟩



Record views


Files downloads