Equitable Chromatic Number of Complete Multipartite Graphs

@inproceedings{Blum2007EquitableCN,
  title={Equitable Chromatic Number of Complete Multipartite Graphs},
  author={Dorothee Blum and Denise Torrey and Richard Hammack},
  year={2007}
}
The equitable chromatic number of a graph is the smallest integer n for which the graph’s vertex set can be partitioned into n independent sets, each pair of which differs in size by at most 1. We develop a formula and a linear–time algorithm which compute the equitable chromatic number of an arbitrary complete multipartite graph. These results yield tractable solutions of certain scheduling problems. 
4 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

The Equitable Coloring of Graphs,

  • K.–W. Lih
  • Handbook of Combinatorial Optimization,
  • 1998

The Equitable Chromatic Number for a Complete Bipartite Graph

  • D. Grittner
  • Undergraduate honors thesis,
  • 1995

The Equitable Coloring of Complete Partite Graphs,

  • B.–L. Chen, C.–H. Wu
  • 1994

Equitable coloring,

  • W. Meyer
  • American Mathematical Monthly,
  • 1973

Similar Papers

Loading similar papers…