Page not found
This question was removed from Theoretical Computer Science Stack Exchange for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- What is the complexity of computing a compatible 3-coloring of a complete graph?
- An improper planar coloring with monochromatic component size $\leq 2$
- What is the complexity of this edge coloring problem?
- How bad can the greedy coloring (list color) for the c-chromatic number of graph be?
- Chromatic number of planar graph with girth at least k
- Anti-chromatic number
- Have these coloring games been solved?
- On the coloring number of small graphs with small cliques
- Is the difference between the acyclic chromatic number and the star chromatic number unbounded?
- Graph coloring with limit on number of times a color is used
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.