Equitable colorings with constant number of colors

S. V. Pemmaraju; K. Nakprasit; A. V. Kostochka

Equitable colorings with constant number of colors

S. V. Pemmaraju, K. Nakprasit, A. V. Kostochka

Research output: Contribution to conference › Paper › peer-review

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 - 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/Territory	United States
City	Boston, MA
Period	11/2/98 → 11/3/98

ASJC Scopus subject areas

Software
General Mathematics

Library availability

Discover UIUC Full Text

Cite this

@conference{619994904f234e249163a38596b96d41,

title = "Equitable colorings with constant number of colors",

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.",

author = "Pemmaraju, {S. V.} and K. Nakprasit and Kostochka, {A. V.}",

year = "2003",

language = "English (US)",

pages = "458--459",

note = "Configuralble Computing: Technology and Applications ; Conference date: 02-11-1998 Through 03-11-1998",

}

TY - CONF

T1 - Equitable colorings with constant number of colors

AU - Pemmaraju, S. V.

AU - Nakprasit, K.

AU - Kostochka, A. V.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0038754142&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038754142&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0038754142

SP - 458

EP - 459

T2 - Configuralble Computing: Technology and Applications

Y2 - 2 November 1998 through 3 November 1998

ER -

Equitable colorings with constant number of colors

Abstract

Other

ASJC Scopus subject areas

Library availability

Related links

Fingerprint

Cite this