Combinatorics and Graph Theory · Problem 5.9.5

Graph Theory — David Guichard

Mathematics — Combinatorics · chromatic-polynomial

Problem

Show that GG is a tree if and only if PG(k)=k(k−1)n−1P_G(k) = k(k-1)^{n-1}.

Browse the problem library