In graph theory, an area of mathematics, an equitable coloring is an assignment of colors to the vertices of an undirected graph, in such a way that… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu
- SIAM J. Discrete Math.
- 2010

A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one. The equitable chromatic… (More)

Is this relevant?

2010

2010

- Hal A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi
- Combinatorica
- 2010

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. The celebrated Hajnal… (More)

Is this relevant?

2008

2008

- Hal A. Kierstead, Alexandr V. Kostochka
- J. Comb. Theory, Ser. B
- 2008

A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this paper, we prove… (More)

Is this relevant?

2006

2006

An equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ in size by at most one… (More)

Is this relevant?

2005

2005

- A. V. Kostochkaa, K. Nakprasita
- 2005

7 An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most 1… (More)

Is this relevant?

2005

2005

- Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju
- SIAM J. Discrete Math.
- 2005

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most 1. A… (More)

Is this relevant?

2003

2003

- Alexandr V. Kostochka, Michael J. Pelsmajer, Douglas B. West
- Journal of Graph Theory
- 2003

Given lists of available colors assigned to the vertices of a graph G, a list coloring is a proper coloring of G such that the… (More)

Is this relevant?

2003

2003

- Raphael Yuster
- SIAM J. Discrete Math.
- 2003

Let H be a k-uniform hypergraph with n vertices. A strong r-coloring is a partition of the vertices into r parts, such that each… (More)

Is this relevant?

2001

2001

- Sriram V. Pemmaraju
- SODA
- 2001

In this paper we extend Chernoff-Hoeffding bounds to situations in which the random variables exhibit "limited" dependence. This… (More)

Is this relevant?

1996

1996

- Ko-Wei Lih, Pou-Lin Wu
- Discrete Mathematics
- 1996

If the vertices of a graph G are partitioned into k classes V~, I/2 ..... Vk such that each V~ is an independent set and I1V~IIV… (More)

Is this relevant?