Equitable Coloring - Special Classes of Graphs

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:

    A successful woman preacher was once asked “what special obstacles have you met as a woman in the ministry?” “Not one,” she answered, “except the lack of a minister’s wife.”
    Anna Garlin Spencer (1851–1931)

    Is a man too strong and fierce for society, and by temper and position a bad citizen,—a morose ruffian, with a dash of the pirate in him;Mnature sends him a troop of pretty sons and daughters, who are getting along in the dame’s classes at the village school, and love and fear for them smooths his grim scowl to courtesy. Thus she contrives to intenerate the granite and the feldspar, takes the boar out and puts the lamb in, and keeps her balance true.
    Ralph Waldo Emerson (1803–1882)