Chromatic polynomial

Chromatic polynomial — хроматический полином графа.

A chromatic polynomial $\,P_{G}(\lambda)$ of a graph $\,G$ is the number of good $\,\lambda$-colorings of $\,G$ ($\lambda = 0, 1, \ldots$). This is a polynomial in $\,\lambda$ (for a fixed $\,G$) and so, its definition can be extended to all real (or complex) values of $\,\lambda$. Note that two $\,\lambda$-colorings differing in the labeling of colors are considered as different.

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.