Lesson plan
Packing coloring
In graph theory, a packing coloring (also called a broadcast coloring) is a type of graph coloring where vertices are assigned colors (represented by positive integers) such that the distance between any two vertices with the same color i is greater than i . The packing chromatic number (or broadcast chromatic number) \chi_\rho(G) (or \chi_b(G) ) of a graph G is the minimum number of colors needed for a packing coloring.
Article summary
In graph theory, a packing coloring (also called a broadcast coloring) is a type of graph coloring where vertices are assigned colors (represented by positive integers) such that the distance between any two vertices with the same color i is greater than i . The packing chromatic number (or broadcast chromatic number) \chi_\rho(G) (or \chi_b(G) ) of a graph G is the minimum number of colors needed for a packing coloring.
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.