---
tag: PP8KNX95EZ
kind: concept
name: Packing coloring
aliases: [packing-chromatic-number]
sources:
  - wikipedia: en:81821737@r1327511270
    locator: Packing coloring
    note: adopted
    mention: wikipedia://en/81821737
    sections: [Summary]
same_as:
  wikidata: Q137392544
  wikipedia: Packing coloring
inventory: [EBATMEEJAJ]
---

## Summary

In graph theory, a **packing coloring** (also called a **broadcast coloring**) is a type of [[graph coloring|0NCPXH194Y]] 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.