Special Classes of Graphs
For any tree with maximum degree Δ, the equitable chromatic number is at most
with the worst case occurring for a star. However, most trees have significantly smaller equitable chromatic number: if a tree with n vertices has Δ ≤ n/3 − O(1), then it has an equitable coloring with only three colors. Furmańczyk (2006) studies the equitable chromatic number of graph products.
Read more about this topic: Equitable Coloring
Famous quotes containing the words special and/or classes:
“I have a special grudge against those who have the same faults as I do.”
—Mason Cooley (b. 1927)
“The difference between people isn’t in their class, but in themselves. Only from the middle classes one gets ideas, and from the common people—life itself, warmth. You feel their hates and loves.”
—D.H. (David Herbert)