Complexity of Grundy Coloring and Its Variants

2015/01/01 by Édouard Bonnet, Florent Foucaud, Eun Jung Kim +1 · 1 citation
Computer Science · #Advanced Graph Theory Research #Biology #Complexity and Algorithms in Graphs #Genetics #Graph Labeling and Dimension Problems

paper · doi:10.1007/978-3-319-21398-9_9

crossref issued 2015/01/01 · crossref published 2015/01/01 · crossref published-print 2015/01/01 · openalex publication_date 2015/01/01 · crossref created 2015/06/23 · crossref published-online 2015/06/24 · crossref deposited 2023/01/20 · crossref indexed 2025/03/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Citations

• Invitation to Fixed-Parameter Algorithms
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Which Problems Have Strongly Exponential Complexity?
• A note on the complexity of the chromatic number problem
• On cliques in graphs
• Some perfect coloring properties of graphs
• Fourier meets möbius: fast subset convolution
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Diameter and Treewidth in Minor-Closed Graph Families
• Combinatorial bounds via measure and conquer
• On‐line and first fit colorings of graphs

Cited by

• Grundy number [wikipedia]