Skip to search formSkip to main contentSkip to account menu

Equitable coloring

Known as: Hajnal-Szemeredi theorem, Equitable chromatic threshold, Hajnal-Szemerédi theorem 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
András HajnalBrooks' theoremChernoff boundClique (graph theory)

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A degree sequence Hajnal-Szemerédi theorem
  • Andrew Treglown
  • Journal of combinatorial theory. Series B (Print)
  • 2014
  • Corpus ID: 33007815
2012
2012
A multipartite Hajnal-Szemerédi theorem
Highly Cited
2010
Highly Cited
2010
A fast algorithm for equitable coloring
A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. The celebrated Hajnal… 
2010
2010
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture
Chen, Lih, and Wu conjectured that for r ≥ 3, the only connected graphs with maximum degree at most r that are not equitably r… 
Review
2010
Review
2010
Ageing and Urbanization: Can Cities be Designed to Foster Active Ageing?
The world is currently experiencing two major demographic transitions: the ageing of populations, particularly in low and middle… 
Highly Cited
2007
Highly Cited
2007
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Die Online-Fachbuchhandlung beck-shop.de ist spezialisiert auf Fachbücher, insbesondere Recht, Steuern und Wirtschaft. Im… 
2005
2005
On Equitable Coloring of d-Degenerate Graphs
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… 
Highly Cited
2003
Highly Cited
2003
A list analogue of equitable coloring
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… 
Highly Cited
2001
Highly Cited
2001
Equitable colorings extend Chernoff-Hoeffding bounds
Chernoff-Hoeffding bounds are sharp tail probability bounds for sums of bounded independent random variables. Often we cannot… 
Highly Cited
1994
Highly Cited
1994
Equitable Coloring and the Maximum Degree
Abstract Let Δ(G) denote the maximum degree of a graph G . The equitable Δ-coloring conjecture asserts that a connected graph G… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)