Journal of Graph Theory · 1986 · 19 citations · 2 references
Natural SciencesMathematicsCombinatoricsGraph TheoryChromatic Polynomials
Abstract We show that a graph G with n vertices is a q ‐tree if and only if its chromatic polynomial is P ( G , λ) = λ(λ – 1) ⃛ (λ – q + 1) (λ – q ) n ‐ q where n ≥ q .
2
An introduction to chromatic polynomials
Ronald C. Read · Journal of Combinatorial Theory · 1968 · 478 citations
Earl Glen Whitehead · Journal of Graph Theory · 1985 · 18 citations