If a unicyclic graph has vertices and its unique graph cycle has length , each of its off-graph cycle vertices contributes a factor after its parent in a rooted tree is coloured. Thus . Substituting the chromatic polynomial of a cycle yields the displayed formula, equivalently by repeated application of the chromatic polynomial after attaching a leaf.
Articles by others on the same topic
There are currently no matching articles.