Codex Wiki
OurBigBook.com
Site
Source code
Chromatic polynomial
(
P
G
(
t
)
)
Home
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Graph colouring
OurBigBook.com
Words: 101
Articles: 2
For each positive integer
t
, the chromatic polynomial
P
G
(
t
)
counts the proper vertex colourings of a finite graph
G
using a fixed palette of
t
colours.
Table of contents
101
2
Deletion-contraction recurrence for the chromatic polynomial
Chromatic polynomial
47
Chromatic polynomial after attaching a leaf
Chromatic polynomial
27
Ancestors
(6)
Graph colouring
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(3)
Chromatic polynomial after attaching a leaf
Solution
Two-colourability criterion for bipartite graphs