Abstract
A new algorithm for equitable colorings and a new bound on the equitable chromatic number of graphs are introduced. Two main themes in the area of equitable coloring are emphasized. The first is to find tight upper bounds on the equitable chromatic number for a class of graphs, usually as a function of Δ. The second is to find constant upper bounds on the equitable chromatic number for a class of graphs from which all "star-like" graphs have been removed.
| Original language | English (US) |
|---|---|
| Pages | 458-459 |
| Number of pages | 2 |
| State | Published - Jan 1 2003 |
| Externally published | Yes |
| Event | Configuralble Computing: Technology and Applications - Boston, MA, United States Duration: Nov 2 1998 → Nov 3 1998 |
Other
| Other | Configuralble Computing: Technology and Applications |
|---|---|
| Country | United States |
| City | Boston, MA |
| Period | 11/2/98 → 11/3/98 |
ASJC Scopus subject areas
- Software
- Mathematics(all)
Fingerprint Dive into the research topics of 'Equitable colorings with constant number of colors'. Together they form a unique fingerprint.
Cite this
Pemmaraju, S. V., Nakprasit, K., & Kostochka, A. V. (2003). Equitable colorings with constant number of colors. 458-459. Paper presented at Configuralble Computing: Technology and Applications, Boston, MA, United States.