A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
2008 ◽
Vol 17
(2)
◽
pp. 265-270
◽
Keyword(s):
A proper vertex colouring of a graph is equitable if the sizes of colour classes differ by at most one. We present a new shorter proof of the celebrated Hajnal–Szemerédi theorem: for every positive integer r, every graph with maximum degree at most r has an equitable colouring with r+1 colours. The proof yields a polynomial time algorithm for such colourings.
1996 ◽
Vol 5
(1)
◽
pp. 15-28
◽
1998 ◽
Vol 7
(4)
◽
pp. 375-386
◽
Keyword(s):
2008 ◽
Vol 19
(03)
◽
pp. 717-727
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
Keyword(s):
Keyword(s):