Combinatorics and Graph Theory · Problem 5.9.2

Graph Theory — David Guichard

Mathematics — Combinatorics · chromatic-polynomial

Problem

Suppose that

G

is not connected and has components

C_1, \ldots, C_k

. Show that

P_G = \prod_{i=1}^k P_{C_i}