Lesson plan
Centered coloring
of the graph. In graph theory, a centered coloring is a type of graph coloring related to treedepth. The minimum number of colors in a centered coloring of a graph equals the graph's treedepth. A parameterized variant, a q -centered coloring, provides a way of covering graphs with a small number of subgraphs of treedepth at most q , and can be used in algorithms for subgraph isomorphism and related problems. The number of colors needed for a q -centered coloring is bounded as a function of q in the graphs of bounded expansion.
Article summary
of the graph. In graph theory, a centered coloring is a type of graph coloring related to treedepth. The minimum number of colors in a centered coloring of a graph equals the graph's treedepth. A parameterized variant, a q -centered coloring, provides a way of covering graphs with a small number of subgraphs of treedepth at most q , and can be used in algorithms for subgraph isomorphism and related problems. The number of colors needed for a q -centered coloring is bounded as a function of q in the graphs of bounded expansion.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.