OurBigBook About$ Donate
 Sign in Sign up

Chromatic polynomial of a unicyclic graph (pG​(x)=(x−1)n+(−1)ℓ(x−1)n−ℓ+1)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Graph coloring Chromatic polynomial
2026-10-25  0 By others on same topic  0 Discussions Create my own version
If a unicyclic graph has n vertices and its unique graph cycle has length ℓ, each of its n−ℓ off-graph cycle vertices contributes a factor x−1 after its parent in a rooted tree is coloured. Thus pG​(x)=(x−1)n−ℓpCℓ​​(x). Substituting the chromatic polynomial of a cycle yields the displayed formula, equivalently by repeated application of the chromatic polynomial after attaching a leaf.

 Ancestors (7)

  1. Chromatic polynomial
  2. Graph coloring
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the graph theory course of the University of Oxford / 2023 / 2 / d / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook