Author:
KIERSTEAD H. A.,KOSTOCHKA A. V.
Abstract
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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A large tree is tK-good;Discrete Mathematics;2023-08
2. Rainbow spanning structures in graph and hypergraph systems;Forum of Mathematics, Sigma;2023
3. A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS;Advances and Applications in Discrete Mathematics;2022-12-16
4. Equitable critical graphs;Discrete Mathematics, Algorithms and Applications;2022-11-15
5. Fair allocation of conflicting items;Autonomous Agents and Multi-Agent Systems;2021-12-23