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:
“The very best reason parents are so special . . . is because we are the holders of a priceless gift, a gift we received from countless generations we never knew, a gift that only we now possess and only we can give to our children. That unique gift, of course, is the gift of ourselves. Whatever we can do to give that gift, and to help others receive it, is worth the challenge of all our human endeavor.”
—Fred Rogers (20th century)
“The most powerful lessons about ethics and morality do not come from school discussions or classes in character building. They come from family life where people treat one another with respect, consideration, and love.”
—Neil Kurshan (20th century)