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

Bruno Escoffier (1)

1 RO - Recherche Opérationnelle

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.

Mots clés: FPT algorithms; Paremeterized complexity; Max coloring; Graph coloring

Domaines: Informatique [cs]

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