Complexity of Grundy coloring and its variants
From MaRDI portal
Publication:1752449
DOI10.1016/j.dam.2017.12.022zbMath1441.05070arXiv1407.5336MaRDI QIDQ1752449
Édouard Bonnet, Florent Foucaud, Florian Sikora, Eun Jung Kim
Publication date: 24 May 2018
Published in: Discrete Applied Mathematics, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.5336
computational complexity; exact algorithm; parameterized complexity; Grundy coloring; connected Grundy coloring; weak Grundy coloring
05C15: Coloring of graphs and hypergraphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)