Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2011

Highly Cited

2011

We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking… Expand

Is this relevant?

2010

2010

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

Is this relevant?

2010

2010

Chen, Lih, and Wu conjectured that for r ≥ 3, the only connected graphs with maximum degree at most r that are not equitably r… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

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… Expand

Is this relevant?

2005

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… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

Abstract In the past decade, increasing interest in equity issues resulted in new methodologies in the area of operations… Expand

Is this relevant?

2003

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… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

Chernoff-Hoeffding bounds are sharp tail probability bounds for sums of bounded independent random variables. Often we cannot… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

Abstract If the vertices of a graph G are partitioned into k classes V 1 , V 2 , …, V k such that each V i is an independent set… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Abstract Let Δ(G) denote the maximum degree of a graph G . The equitable Δ-coloring conjecture asserts that a connected graph G… Expand

Is this relevant?