The Equitable Coloring of Graphs

Ko-Wei Lih ()
Additional contact information
Ko-Wei Lih: Academia Sinica, Institute of Mathematics

A chapter in Handbook of Combinatorial Optimization, 1998, pp 2015-2038 from Springer

Abstract: Abstract Let the vertices of a graph G be colored with k colors such that no adjacent vertices receive the same color and the sizes of the color classes differ by at most one. Then G is said to be equitably k-colorable. The equitable chromatic number x = (G) is the smallest integer k such that G is equitably k-colorable. In this article, we survey recent progress on the equitable coloring of graphs. We pay more attention to work done on the Equitable ∆-Coloring Conjecture. We also discuss related graph coloring notions and their problems. The survey ends with suggestions for further research topics.

Keywords: Equitable coloring; Equitable edge coloring; m-bounded coloring; Equalized total coloring (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0303-9_31

Ordering information: This item can be ordered from
http://www.springer.com/9781461303039

DOI: 10.1007/978-1-4613-0303-9_31

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().