" This is the first book to comprehensively cover chromatic polynomials of graphs. It includes
most of the known results and unsolved problems in the area of chromatic polynomials …

Let $ P (G, x) $ be the chromatic polynomial of a graph $ G $. A graph $ G $ is called\textit
{chromatically unique} if for any graph $ H,\, P (G, x)= P (H, x) $ implies that $ G $ and $ H …

The chromatic equivalence class of a graph G is the set of graphs that have the same
chromatic polynomial as G. We find the chromatic equivalence class of the complete …

We obtain new necessary conditions on a graph which shares the same chromatic
polynomial as that of the complete tripartite graph Km, n, r. Using these, we establish the …

Let P (G, λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if
for any graph H, P (H, λ)= P (G, λ) implies H is isomorphic to G. Liu et al.[Liu, RY, Zhao, HX …

For any graph $ G $, we use $ P (G,\lambda) $ to denote the the chromatic polynomial of $ G
$. Two graphs $ G $ and $ H $ are said to be equivalent, simply denoted by $ G\sim H $, if …

The Tutte polynomial is surely the most studied graph polynomial, particularly when all of its
many specializations, generalizations, and applications are included. The impact of the Tutte …

Теория раскрасок графов ведет свое начало с задачи о четырех красках. В 1852 году
Френсис Гутри заметил, что достаточно четырех цветов чтобы раскрасить карту …

Let P (G, λ) be the chromatic polynomial of a graph G. For graphs G and H, if P (G, λ)= P (H,
λ), then G and H are said to be chromatically equivalent. A graph G is chromatically unique if …

Let 𝑃 (𝐺, 𝑥) be the chromatic polynomial of a graph 𝐺. A graph 𝐺 is called chromatically
unique if for any graph 𝐻, 𝑃 (𝐺, 𝑥)= 𝑃 (𝐻, 𝑥) implies that 𝐺 and 𝐻 are isomorphic. In this …