Skip to main content
SpringerLink
Log in

Equitable Coloring of Graphs

  • Reference work entry
  • First Online:
Handbook of Combinatorial Optimization

Abstract

If the vertices of a graph G are colored with k colors such that no adjacent vertices receive the same color and the sizes of any two color classes differ by at most one, then G is said to be equitably k-colorable. The equitable chromatic number \(\chi _{_{=}}(G)\) is the smallest integer k such that G is equitably k-colorable. In the first introduction section, results obtained about the equitable chromatic number before 1990 are surveyed. The research on equitable coloring has attracted enough attention only since the early 1990s. In the subsequent sections, positive evidence for the important equitable Δ-coloring conjecture is supplied from graph classes such as forests, split graphs, outerplanar graphs, series-parallel graphs, planar graphs, graphs with low degeneracy, graphs with bounded treewidth, Kneser graphs, and interval graphs. Then three kinds of graph products are investigated. A list version of equitable coloring is introduced. The equitable coloring is further examined in the wider context of graph packing. Appropriate conjectures for equitable Δ-coloring of disconnected graphs are then studied. Variants of the well-known and significant Hajnal and Szemerédi Theorem are discussed. A brief summary of applications of equitable coloring is given. Related notions, such as equitable edge coloring, equitable total coloring, equitable defective coloring, and equitable coloring of uniform hypergraphs, are touched upon. This chapter ends with a short conclusion section. This survey is an updated version of Lih [102].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. M. Aigner, S. Brant, Embedding arbitrary graphs of maximum degree two. J. Lond. Math. Soc. II Ser. 48, 39–51 (1993)

    MATH  Google Scholar 

  2. M.M. Akbar Ali, K. Kaliraj, J. Vernold Vivin, On equitable coloring of central graphs and total graphs. Electron. Notes Discret. Math. 33, 1–6 (2009)

    Google Scholar 

  3. N. Alon, Transversal numbers of uniform hypergraphs. Graphs Combin. 6, 1–4 (1990)

    MathSciNet  MATH  Google Scholar 

  4. N. Alon, E. Fischer, 2-factors in dense graphs. Discret. Math. 152, 13–23 (1996)

    MathSciNet  MATH  Google Scholar 

  5. N. Alon, Z. Füredi, Spanning subgraphs of random graphs. Graphs Combin. 8, 91–94 (1992)

    MathSciNet  MATH  Google Scholar 

  6. L. Bahiense, Y. Frota, T.F. Noronha, C.C. Ribeiro, A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives. Discret. Appl. Math. doi:10.1016/j.dam.2011.10.008

    Google Scholar 

  7. B. Baker, E. Coffman, Mutual exclusion scheduling. Theor. Comput. Sci. 162, 225–243 (1996)

    MathSciNet  MATH  Google Scholar 

  8. J. Balogh, C. Lee, W. Samotij, Corrádi and Hajnal’s theorem for sparse random graphs. arXiv:1011.5443

    Google Scholar 

  9. M. Behzad, Graphs and their chromatic numbers. Ph.D. dissertation, Michigan State University, U.S.A., 1965

    Google Scholar 

  10. C. Bentz, C. Picouleau, Locally bounded k-colorings of trees. RAIRO-Oper. Res. 43, 27–33 (2009)

    MathSciNet  MATH  Google Scholar 

  11. J. Blazewics, K. Ecker, E. Pesch, G. Schmidt, J. Weglarz, Scheduling Computer and Manufacturing Processes (Springer, Berlin, 2001)

    Google Scholar 

  12. D. Blum, D. Torrey, R. Hammack, Equitable chromatic numbers of complete multipartite graphs. MO. J. Math. Sci. 15, 75–81 (2003)

    MathSciNet  Google Scholar 

  13. H.L. Bodlaender, F.V. Fomin, Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349, 22–30 (2005)

    MathSciNet  MATH  Google Scholar 

  14. H.L. Bodlaender, K. Jansen, On the complexity of scheduling incompatible jobs with unit-times, in Foundations of Computer Science 1993. Lecture Notes in Computer Science, vol. 711 (Springer, Berlin/New York, 1993), pp. 291–300

    Google Scholar 

  15. B. Bollobás, S.E. Eldridge, Maximal matchings in graphs with given maximal and minimal degrees. Congr. Numer. 15, 165–168 (1976)

    Google Scholar 

  16. B. Bollobás, R.K. Guy, Equitable and proportional coloring of trees. J. Comb. Theory Ser. B 34, 177–186 (1983)

    MATH  Google Scholar 

  17. B. Bollobás, A.V. Kostochka, K. Nakprasit, Packing d-degenerate graphs. J. Comb. Theory Ser. B 98, 85–94 (2008)

    MATH  Google Scholar 

  18. A. Brandstadt, V.B. Le, J.P. Spinrad, Graph Classes: A Survey (SIAM, Philadelphia, 1999)

    Google Scholar 

  19. R.L. Brooks, On colouring the nodes of a network. Proc. Camb. Philos. Soc. 37, 194–197 (1941)

    MathSciNet  Google Scholar 

  20. P.A. Catlin, Subgraphs of graphs I. Discret. Math. 10, 225–233 (1974)

    MathSciNet  MATH  Google Scholar 

  21. P.A. Catlin, On the Hajnal-Szemerédi theorem on disjoint cliques. Util. Math. 17, 163–177 (1980)

    MathSciNet  MATH  Google Scholar 

  22. G.J. Chang, A note on equitable colorings of forests. Eur. J. Comb. 30, 809–812 (2009)

    MATH  Google Scholar 

  23. G. Chartrand, D. Geller, S. Hedetniemi, Graphs with forbidden subgraphs. J. Comb. Theory Ser. B 10, 12–41 (1971)

    MathSciNet  MATH  Google Scholar 

  24. B.-L. Chen, K.-C. Huang, The equitable colorings of Kneser graphs. Taiwan. J. Math. 12, 887–900 (2008)

    MATH  Google Scholar 

  25. B.-L. Chen, K.-W. Lih, A note on the m-bounded chromatic number of a tree. Eur. J. Comb. 14, 311–312 (1993)

    MathSciNet  MATH  Google Scholar 

  26. B.-L. Chen, K.-W. Lih, Equitable coloring of trees. J. Comb. Theory Ser. B 61, 83–87 (1994)

    MathSciNet  MATH  Google Scholar 

  27. B.-L. Chen, C.-H. Yen, Equitable Δ-coloring of graphs. Discret. Math. 312, 1512–1517 (2012)

    MathSciNet  MATH  Google Scholar 

  28. B.-L. Chen, K.-W. Lih, P.-L. Wu, Equitable coloring and the maximum degree. Eur. J. Comb. 15, 443–447 (1994)

    MathSciNet  MATH  Google Scholar 

  29. B.-L. Chen, M.-T. Ko, K.-W. Lih, Equitable and m-bounded coloring of split graphs, in Combinatorics and Computer Science. Lecture Notes in Computer Science, vol. 1120 (Springer, Berlin/New York, 1996), pp. 1–5

    Google Scholar 

  30. B.-L. Chen, K.-C. Huang, C.-H. Yen, Chromatic coloring with a maximum color class. Discret. Math. 308, 5533–5537 (2008)

    MathSciNet  MATH  Google Scholar 

  31. B.-L. Chen, K.-W. Lih, J.-H. Yan, Equitable colorings of interval graphs and products of graphs. arXiv:0903.1396

    Google Scholar 

  32. B.-L. Chen, K.-W. Lih, C.-H. Yen, Equivalence of two conjectures on equitable coloring of graphs. J. Comb. Optim. doi:10.1007/s10878-011-9429-8

    Google Scholar 

  33. T. Chunling, L. Xiaohui, Y. Yuansheng, L. Zhihe, Equitable total coloring of C m □C n . Discret. Appl. Math. 157, 596–601 (2009)

    MATH  Google Scholar 

  34. K. Corrádi, A. Hajnal, On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hung. 14, 423–439 (1963)

    MATH  Google Scholar 

  35. B. Csaba, M. Mydlarz, Approximate multipartite version of the Hajnal-Szemerédi theorem. J. Comb. Theory Ser. B 102, 395–410 (2012)

    MathSciNet  MATH  Google Scholar 

  36. B. Csaba, A. Shokoufandeh, E. Szemerédi, Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three. Combinatorica 23, 35–72 (2003)

    MathSciNet  MATH  Google Scholar 

  37. S.K. Das, I. Finocchi, R. Petreschi, Conflict-free star-access in parallel memory systems. J. Parallel Distrib. Comput. 66, 1431–1441 (2006)

    MATH  Google Scholar 

  38. D. de Werra, Equitable colorations of graphs. Rev. Française Informat. Recherche Opérationnelle R-3, 3–8 (1971)

    Google Scholar 

  39. D. de Werra, Some uses of hypergraph in timetabling. Asis-Pac. J. Oper. Res. 2, 2–12 (1985)

    MATH  Google Scholar 

  40. G. Dirac, Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69–81 (1952)

    MathSciNet  MATH  Google Scholar 

  41. R.G. Downey, M.R. Fellows, Parametrized Complexity (Springer, New York, 1999)

    Google Scholar 

  42. D. Duffus, B. Sands, R.E. Woodrow, On the chromatic number of the product of graphs. J. Graph Theory 9, 487–495 (1985)

    MathSciNet  MATH  Google Scholar 

  43. P. Erdős, Problem 9, in Theory of Graphs and Its Applications, ed. by M. Fieldler (Czech Academy of Science Publishing, Prague, 1964), p. 159

    Google Scholar 

  44. P. Erdős, C. Ko, R. Rado, Intersection theorems for systems of the finite sets. Q. J. Math. Oxf. (2) 12, 31–320 (1961)

    Google Scholar 

  45. P. Erdős, A.L. Rubin, H. Taylor, Choosability in graphs. Congr. Numer. 26, 125–157 (1980)

    Google Scholar 

  46. H. Fan, H.A. Kierstead, G. Liu, T. Molla, J.-L. Wu, X. Zhang, A note on relaxed equitable coloring of graphs. Inf. Process. Lett. 111, 1062–1066 (2011)

    MathSciNet  MATH  Google Scholar 

  47. M.R. Fellows, F.V. Fomin, D. Lokshtanov, F. Rosamond, S. Sauraby, S. Szeider, C. Thomassen, On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209, 143–153 (2011)

    MATH  Google Scholar 

  48. J. Fiala, P.A. Golovach, J. Kratochvíl, Parameterized complexity of coloring problems: treewidth versus vertex cover. Theor. Comput. Sci. 412, 2513–2523 (2011)

    MATH  Google Scholar 

  49. R. Fidytek, H. Furmańczyk, P. Żyliński, Equitable coloring of Kneser graphs. Discuss. Math. Graph Theory 29, 119–142 (2009)

    MathSciNet  MATH  Google Scholar 

  50. E. Fischer, Variants of the Hajnal-Szemerédi theorem. J. Graph Theory 31, 275–282 (1999)

    MathSciNet  MATH  Google Scholar 

  51. J. Flum, M. Grohe, Parametrized Complexity Theory (Springer, New York, 2006)

    MATH  Google Scholar 

  52. H.-L. Fu, Some results on equalized total coloring. Congr. Numer. 102, 111–119 (1994)

    MathSciNet  MATH  Google Scholar 

  53. H. Furmańczyk, Equitable coloring of graphs, in Graph Colorings, ed. by M. Kubale. Contemporary Mathematics, vol. 352 (American Mathematical Society, Providence, 2004), pp. 35–53

    Google Scholar 

  54. H. Furmańczyk, Equitable coloring of graph products. Opusc. Math. 26, 31–44 (2006)

    Google Scholar 

  55. H. Furmańczyk, M. Kubale, The complexity of equitable vertex coloring of graphs. J. Appl. Comput. Sci. 13, 97–107 (2005)

    Google Scholar 

  56. H. Furmańczyk, K. Giaro, M. Kubale, Equitable 4-coloring of cacti and edge-cacti in polynomial time. Int. J. Pure Appl. Math. 27, 377–389 (2006)

    MathSciNet  Google Scholar 

  57. H. Furmańczyk, K. Kaliraj, J. Vernold Vivin, Equitable coloring on corona graphs of graphs with complete graphs, cycles and paths. Manuscript (2010)

    Google Scholar 

  58. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, San Francisco, 1979)

    MATH  Google Scholar 

  59. P.C. Gilmore, A.J. Hoffman, Characterization of comparability graphs and interval graphs. Can. J. Math. 16, 539–548 (1964)

    MathSciNet  MATH  Google Scholar 

  60. D. Gonçalves, Edge partition of planar graphs into two outerplanar graphs, in STOC’05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (ACM, New York, 2005), pp. 504–512

    Google Scholar 

  61. H. Grötzsch, Zur Theorie der diskreten Gebilde. VII. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg. Math.-Nat. Reihe 8, 109–120 (1958/1959)

    MathSciNet  Google Scholar 

  62. R.P. Gupta, On decompositions of a multigraph into spanning subgraphs. Bull. Am. Math. Soc. 80, 500–502 (1974)

    MATH  Google Scholar 

  63. R.K. Guy, Monthly research problems, 1969–1975. Am. Math. Mon. 82, 995–1004 (1975)

    MathSciNet  MATH  Google Scholar 

  64. A. Hajnal, E. Szemerédi, Proof of a conjecture of Erdős, in Combinatorial Theory and Its Applications, ed. by P. Erdős, A. Rényi, V. T. Sós, vol. II. Colloquia Mathematica Societatis Janos Bolyai, vol. 4 (North-Holland, Amsterdam, 1970), pp. 601–623

    Google Scholar 

  65. J. Han, Y. Zhao, On multipartite Hajnal-Szemerédi theorems. arXiv:1203.2667

    Google Scholar 

  66. P. Hansen, A. Hertz, J. Kuplinsky, Bounded vertex colorings of graphs. Discret. Math. 111, 305–312 (1993)

    MathSciNet  MATH  Google Scholar 

  67. S. Hedetniemi, Homomorphism of graphs and automata. Univ. Michigan Technical Report 03105-44-7, 1966

    Google Scholar 

  68. A.J. W. Hilton, D. de Werra, A sufficient condition for equitable edge-colourings of simple graphs. Discret. Math. 128, 179–201 (1994)

    MATH  Google Scholar 

  69. A.J.W. Hilton, E.C. Milner, Some intersection theorems for systems of finite sets. Q. J. Math. Oxford (2) 18, 369–384 (1967)

    MathSciNet  Google Scholar 

  70. S. Irani, V. Leung, Scheduling with conflicts, and applications to traffic signal control, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, Philadelphia, 1996), pp. 85–94

    Google Scholar 

  71. S. Janson, T. Łuczak, A. Rusiński, Random Graphs (Wiley-Interscience, New York, 2000)

    MATH  Google Scholar 

  72. S. Janson, A. Rusiński, The infamous upper tail. Random Struct. Algorithms 20, 317–342 (2002)

    MATH  Google Scholar 

  73. M. Jarvis, B. Zhou, Bounded vertex coloring of trees. Discret. Math. 232, 145–151 (2001)

    MathSciNet  MATH  Google Scholar 

  74. P.K. Jha, Hypercubes, median graphs and products of graphs: some algorithmic and combinatorial results. Ph.D. Dissertation, Iowa State Univ., 1990

    Google Scholar 

  75. R. Johansson, Triangle factors in a balanced blown-up triangle. Discret. Math. 211, 249–254 (2000)

    MathSciNet  MATH  Google Scholar 

  76. K. Kaliraj, J. Vernold Vivin, On equitable coloring of helm graph and gear graph. Int. J. Math. Comb. 4, 32–37 (2010)

    Google Scholar 

  77. K. Kaliraj, J. Veninstine Vivik, Equitable coloring of corona graphs. J. Comb. Math. Comb. Comput. to appear

    Google Scholar 

  78. K. Kaliraj, J. Veninstine Vivik, J. Vernold Vivin, Equitable coloring on corona graph of graphs. J. Comb. Math. Comb. Comput. 81, 191–197 (2012)

    MATH  Google Scholar 

  79. H. Kaul, A.V. Kostochka, G. Yu, On a graph packing conjecture of Bollobás, Eldridge, and Catlin. Combinatorica 28, 469–485 (2008)

    MathSciNet  MATH  Google Scholar 

  80. P. Keevash, R. Mycroft, A multipartite Hajnal-Szemerédi theorem. arXiv:1201.1882

    Google Scholar 

  81. H.A. Kierstead, A.V. Kostochka, An Ore-type theorem on equitable coloring. J. Comb. Theory Ser. B 98, 226–234 (2008)

    MathSciNet  MATH  Google Scholar 

  82. H.A. Kierstead, A.V. Kostochka, A short proof of the Hajnal-Szemerédi theorem on equitable colouring. Comb. Probab. Comput. 17, 265–270 (2008)

    MathSciNet  MATH  Google Scholar 

  83. H.A. Kierstead, A.V. Kostochka, Ore-type versions of Brooks’ theorem. J. Comb. Theory Ser. B 99, 298–305 (2009)

    MathSciNet  MATH  Google Scholar 

  84. H.A. Kierstead, A.V. Kostochka, Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture. Combinatorica 30, 201–216 (2010)

    MathSciNet  MATH  Google Scholar 

  85. H.A. Kierstead, A.V. Kostochka, Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring. J. Graph Theory. 71, 31–48 (2012)

    MathSciNet  MATH  Google Scholar 

  86. H.A. Kierstead, A.V. Kostochka, G. Yu, Extremal graph packing problems: Ore-type versus Dirac-type, in Surveys in Combinatorics 2009. London Mathematical Society Lecture Note Series, vol. 365 (Cambridge University Press, Cambridge, 2009), pp. 113–135

    Google Scholar 

  87. H.A. Kierstead, A.V. Kostochka, M. Mydlarz, E. Szemerédi, A fast algorithm for equitable coloring. Combinatorica 30, 217–224 (2010)

    MathSciNet  MATH  Google Scholar 

  88. J. Komolós, G. Sárkőzy, E. Szemerédi, Blow-up lemma. Combinatorica 17, 109–123 (1997)

    MathSciNet  Google Scholar 

  89. J. Komolós, G. Sárkőzy, E. Szemerédi, On the Pósa-Seymour conjecture. J. Graph Theory 29, 167–176 (1998)

    MathSciNet  Google Scholar 

  90. J. Komolós, G. Sárkőzy, E. Szemerédi, Proof of Seymour’s conjecture for large graphs. Ann. Comb. 1, 43–60 (1998)

    Google Scholar 

  91. A.V. Kostochka, Equitable colorings of outerplanar graphs. Discret. Math. 258, 373–377 (2002)

    MathSciNet  MATH  Google Scholar 

  92. A.V. Kostochka, K. Nakprasit, Equitable colourings of d-degenerate graphs. Comb. Probab. Comput. 12, 53–60 (2003)

    MathSciNet  MATH  Google Scholar 

  93. A.V. Kostochka, K. Nakprasit, On equitable Δ-coloring of graphs with low average degree. Theor. Comput. Sci. 349, 82–91 (2005)

    MathSciNet  MATH  Google Scholar 

  94. A.V. Kostochka, M.J. Pelsmajer, D.B. West, A list analogue of equitable coloring. J. Graph Theory 44, 166–177 (2003)

    MathSciNet  MATH  Google Scholar 

  95. A.V. Kostochka, K. Nakprasit, S.V. Pemmaraju, On equitable coloring of d-degenerate graphs. SIAM J. Discret. Math. 19, 83–95 (2005)

    MathSciNet  MATH  Google Scholar 

  96. A.V. Kostochka, L. Rabern, M. Stiebitz, Graphs with chromatic number close to maximum degree. Discret. Math. 312, 1273–1281 (2012)

    MathSciNet  MATH  Google Scholar 

  97. J. Krarup, D. de Werra, Chromatic optimisation: limitations, objectives, uses, references. Eur. J. Oper. Res. 11, 1–19 (1982)

    MATH  Google Scholar 

  98. M. Krivelevich, B. Patkós, Equitable coloring of random graphs. Random Struct. Algorithms 35, 83–99 (2009)

    MATH  Google Scholar 

  99. P.C.B. Lam, W.C. Shiu, C.S. Tong, Z.F. Zhang, On the equitable chromatic number of complete n-partite graphs. Discret. Appl. Math. 113, 307–310 (2001)

    MathSciNet  MATH  Google Scholar 

  100. Q. Li, Y. Bu, Equitable list coloring of planar graphs without 4- and 6-cycles. Discret. Math. 309, 280–287 (2009)

    MathSciNet  MATH  Google Scholar 

  101. K.-W. Lih, The equitable coloring of graphs, in Handbook of Combinatorial Optimization, vol. 3, ed. by D.-Z. Du, P.M. Pardlos (Kluwer, Boston, 1998), pp. 543–566

    Google Scholar 

  102. K.-W. Lih, P.-L. Wu, On equitable coloring of bipartite graphs. Discret. Math. 151, 155–160 (1996)

    MathSciNet  MATH  Google Scholar 

  103. W.-H. Lin, Equitable colorings of graph products. Ph.D. Dissertation, National Taiwan University, Taiwan, 2009

    Google Scholar 

  104. W.-H. Lin, G.J. Chang, Equitable colorings of Kronecker products of graphs. Discret. Appl. Math. 158, 1816–1826 (2010)

    MathSciNet  MATH  Google Scholar 

  105. W.-H. Lin, G.J. Chang, Equitable colorings of Cartesian products of graphs. Discret. Appl. Math. 160, 239–247 (2012)

    MathSciNet  MATH  Google Scholar 

  106. A. Lo, K. Markström, A multipartite version of the Hajnal-Szemerédi theorem for graphs and hypergraphs. Combin. Prob. Comput. 22, 97–111 (2013)

    MATH  Google Scholar 

  107. L. Lovász, Kneser’s conjecture, chromatic number, and homotopy. J. Comb. Theory Ser. A 25, 319–324 (1978)

    MATH  Google Scholar 

  108. R. Luo, J. S. Sereni, D.C. Stephen, G. Yu, Equitable coloring of sparse planar graphs. SIAM J. Discret. Math. 24, 1572–1583 (2010)

    MATH  Google Scholar 

  109. Cs. Magyar, R. Martin, Tripartite version of the Corrádi-Hajnal theorem. Discret. Math. 254, 289–308 (2002)

    MathSciNet  MATH  Google Scholar 

  110. A.W. Marshall, I. Olkin, Inequalities: Theory of Majorization and Its Applications (Academic, New York, 1979)

    MATH  Google Scholar 

  111. R. Martin, E. Szemerédi, Quadripartite version of the Hajnal-Szemerédi theorem. Discret. Math. 308, 4337–4360 (2008)

    MATH  Google Scholar 

  112. I. Méndez-Díaz, G. Nasini, D. Severín, A polyhedral approach for the graph equitable coloring problem. Discret. Appl. Math. doi:10.1016/j.dam.2012.11.018

    Google Scholar 

  113. I. Méndez-Díaz, G. Nasini, D. Severín, A linear integer programming approach for the equitable coloring problem. in: II Congreso de Matematica Aplicada, Computacional e Industrial, Argentina (2009)

    Google Scholar 

  114. I. Méndez-Díaz, G. Nasini, D. Severín, Polyhedral results for the equitable coloring problem. Electron. Notes Discret. Math. 37, 159–164 (2011)

    Google Scholar 

  115. W. Meyer, Equitable coloring. Am. Math. Mon. 80, 920–922 (1973)

    MATH  Google Scholar 

  116. D. Miyata, S. Tokunaga, A. Kaneko, Equitable coloring of trees. Manuscript

    Google Scholar 

  117. K. Nakprasit, Equitable colorings of planaar graphs with maximum degree at least nine. Discret. Math. 312, 1019–1024 (2012)

    MathSciNet  MATH  Google Scholar 

  118. K. Nakprasit, K. Nakprasit, Equitable colorings of planar graphs without short cycles. Theoret. Comput. Sci. 465, 21–27 (2012)

    MathSciNet  MATH  Google Scholar 

  119. R. Niedermeier, Invitation to Fixed Parameter Algorithms (Oxford University Press, Oxford/New York, 2006)

    MATH  Google Scholar 

  120. S. Olariu, An optimal greedy heuristic to color interval graphs. Inf. Process. Lett. 37, 21–25 (1991)

    MathSciNet  MATH  Google Scholar 

  121. O. Ore, Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)

    MathSciNet  MATH  Google Scholar 

  122. M.J. Pelsmajer, Equitable list-coloring for graphs of maximum degree 3. J. Graph Theory 47, 1–8 (2004)

    MathSciNet  MATH  Google Scholar 

  123. M.J. Pelsmajer, Equitable list coloring and treewidth. J. Graph Theory 61, 127–139 (2009)

    MathSciNet  MATH  Google Scholar 

  124. S.V. Pemmaraju, Equitable coloring extends Chernoff-Hoeffding bounds, in Approximation, Randomization, and Combinatorial Optimization, Berkeley, CA, 2001. Lecture Notes in Computer Science, vol. 2129 (Springer, 2001), pp. 285–296

    Google Scholar 

  125. S.V. Pemmaraju, Coloring outerplanar graphs equitably. Manuscript (2001)

    Google Scholar 

  126. S.V. Pemmaraju, K. Nakprasit, A.V. Kostochka, Equitable colorings with constant number of colors, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, 2003 (ACM, 2003), pp. 458–459

    Google Scholar 

  127. L. Rabern, Δ-critical graphs with small high vertex cliques. J. Comb. Theory Ser. B 102, 126–130 (2012)

    MathSciNet  MATH  Google Scholar 

  128. V. Rödl, A. Ruciński, Perfect matchings in ε-regular graphs and the blow-up lemma. Combinatorica 19, 437–452 (1999)

    MathSciNet  MATH  Google Scholar 

  129. D.J. Rose, On simple characterizations of k-trees. Discret. Math. 7, 317–322 (1974)

    MATH  Google Scholar 

  130. G. Sabidussi, Graphs with given group and given graph-theoretical properties. Can. J. Math. 9, 515–525 (1957)

    MathSciNet  MATH  Google Scholar 

  131. N. Sauer, Hedetniemi’s conjecture – a survey. Discret. Math. 229, 261–292 (2001)

    MathSciNet  MATH  Google Scholar 

  132. P. Seymour, Problem section, in Combinatorics: Proceedings of the British Combinatorial Conference, 1973, ed. by T.P. McDonough, V.C. Mavron (Cambridge University Press, Cambridge, 1974), pp. 201–202

    Google Scholar 

  133. A. Shioura, M. Yagiura, A fast algorithm for computing a nearly equitable edge colring with balanced conditions. J. Graph Algorithms Appl. 14, 391–407 (2010)

    MathSciNet  MATH  Google Scholar 

  134. B.F. Smith, P.E. Bjorstad, W.D. Group, Domain Decomposition. Parallel Multilevel Methods for Elliptic Partial Differential Equations (Cambridge University Press, Cambridge/New York, 1996)

    Google Scholar 

  135. H. Song, J. Wu, G. Liu, The equitable edge-coloring of series-parallel graphs, in Computational Science – ICCS 2007, Beijing, China, 2007. Lecture Notes in Computer Science, vol. 4489 (Springer, 2007), pp. 457–460

    Google Scholar 

  136. E. Szemerédi, Regular partitions of graphs, in Colloques Internationaux C.N.R.S. No. 260 Problèmes Combinatoires et Théorie des Graphes, Orsay, 1976, pp. 399–401

    Google Scholar 

  137. X. Tan, Equitable Δ-coloring of planar graphs without 4-cycles, in Proceedings of ISORA’10, Chengdu-Jiuzhaigou, China (ORSC & APORC, 2010), pp. 400–405

    Google Scholar 

  138. A.C. Tucker, Perfect graphs and an application to optimizing municipal services. SIAM Rev. 15, 585–590 (1973)

    MathSciNet  MATH  Google Scholar 

  139. J. van Leeuwen, Graph algorithms, in Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory (The MIT Press, Cambridge, 1990)

    Google Scholar 

  140. J. Vernold Vivin, K. Kaliraj, M.M. Akbar Ali, Equitable coloring on total graph of bigraphs and central graph of cycles and paths. Int. J. Math. Math. Sci. doi:10.1155/2011/279246 (2011)

    Google Scholar 

  141. K. Vesztergombi, Some remarks on the chromatic number of the strong product of graphs. Colloq. Math. Soc. János Bolyai 25, 143–149 (1997)

    Google Scholar 

  142. V.G. Vizing, On an estimate of the chromatic class of a p-graph. Diskret. Analiz. 3, 25–30 (1964). (in Russian)

    MathSciNet  Google Scholar 

  143. V.G. Vizing, Some unsolved problems in graph theory. Uspehi Mat. Nauk 23, 117–134 (1968). (in Russian)

    MathSciNet  MATH  Google Scholar 

  144. V.G. Vizing, Coloring the vertices of a graph in prescribed colors. Diskret. Analiz. 29, 3–10 (1976). (in Russian)

    MathSciNet  MATH  Google Scholar 

  145. W. Wang, Equitable total coloring of graphs with maximum degree 3. Graphs Comb. 18, 677–685 (2002)

    MATH  Google Scholar 

  146. W. Wang, K.-W. Lih, Equitable list coloring of graphs. Taiwan. J. Math. 8, 747–759 (2004)

    MathSciNet  MATH  Google Scholar 

  147. H. Wang, L. Sun, Equitable total chromatic number of Mycielski graphs of two classes of graphs. Sci. Technol. Rev. 206, 29–30 (2005)

    Google Scholar 

  148. H. Wang, J. Wei, The equitable total chromatic number of the graph HM(W n ). J. Appl. Math. Comput. 24, 313–323 (2007)

    MathSciNet  Google Scholar 

  149. W. Wang, K. Zhang, Equitable colorings of line graphs and complete r-partite graphs. Syst. Sci. Math. Sci. 13, 190–194 (2000)

    MATH  Google Scholar 

  150. L. Williams, J. Vandenbussche, G. Yu, Equitable defective coloring of sparse planar graphs. Discret. Math. 312, 957–962 (2012)

    MathSciNet  MATH  Google Scholar 

  151. M. Wozniak, Packing of graphs. Discret. Math. 362, 1–78 (1997)

    Google Scholar 

  152. J. Wu, The equitable edge-coloring of outerplanar graphs. J. Comb. Math. Comb. Comput. 36, 247–253 (2001)

    MATH  Google Scholar 

  153. J. Wu, P. Wang, Equitable coloring planar graphs with large girth. Discret. Math. 308, 985–990 (2008)

    MATH  Google Scholar 

  154. X. Xie, M. Yagiura, T. Ono, T. Hirata, U. Zwick, An efficient algorithm for the nearly equitable edge coloring problem. J. Graph Algorithms Appl. 12, 383–399 (2008)

    MathSciNet  MATH  Google Scholar 

  155. H.P. Yap, Y. Zhang, On equitable colorings of graphs. Manuscript (1996)

    Google Scholar 

  156. H.P. Yap, Y. Zhang, The equitable-colouring conjecture holds for outerplanar graphs. Bull. Inst. Math. Acad. Sin. 25, 143–149 (1997)

    MathSciNet  MATH  Google Scholar 

  157. R. Yuster, Equitable coloring of k-uniform hypergraphs. SIAM J. Discret. Math. 16, 524–532 (2003)

    MathSciNet  MATH  Google Scholar 

  158. Z. Zhang, G. Liu, Equitable edge-colorings of simple graphs. J. Graph Theory 66, 175–197 (2011)

    MathSciNet  MATH  Google Scholar 

  159. X. Zhang, J.-L. Wu, On equitable and equitable list colorings of series-parallel graphs. Discret. Math. 311, 800–803 (2011)

    MATH  Google Scholar 

  160. Y. Zhang, H.P. Yap, Equitable colorings of planar graphs. J. Comb. Math. Comb. Comput. 27, 97–105 (1998)

    MathSciNet  MATH  Google Scholar 

  161. X. Zhu, A survey on Hedetniemi’s conjecture. Taiwan. J. Math. 2, 1–24 (1998)

    MATH  Google Scholar 

  162. J. Zhu, Y. Bu, Equitable list colorings of planar graphs without short cycles. Theor. Comput. Sci. 407, 21–28 (2008)

    MathSciNet  MATH  Google Scholar 

  163. J. Zhu, Y. Bu, Equitable and equitable list colorings of graphs. Theor. Comput. Sci. 411, 3873–3876 (2010)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Academia Sinica, 6F, Astronomy-Mathematics Building; No. 1, Sec. 4 Roosevelt Road, 10617, Taipei, Taiwan

    Ko-Wei Lih

Authors
  1. Ko-Wei Lih
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ko-Wei Lih .

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Eng, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Department of Computer Science, University of Texas, Dallas, Richardson, Texas, USA

    Ding-Zhu Du

  3. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Lih, KW. (2013). Equitable Coloring of Graphs. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7997-1_25

Download citation

Publish with us

Policies and ethics

Search

Navigation