, Volume 80, Issue 11, pp 3293–3315 | Cite as

Batch Coloring of Graphs

  • Joan Boyar
  • Leah Epstein
  • Lene M. Favrholdt
  • Kim S. Larsen
  • Asaf Levin


We study two versions of graph coloring, where the goal is to assign a positive integer color to each vertex of an input graph such that adjacent vertices do not receive the same color assignment. For classic vertex coloring, the goal is to minimize the maximum color used, and for the sum coloring problem, the goal is to minimize the sum of colors assigned to all input vertices. In the offline variant, the entire graph is presented at once, and in online problems, one vertex is presented for coloring at each time, and the only information is the identity of its neighbors among previously known vertices. In batched graph coloring, vertices are presented in k batches, for a fixed integer \(k \ge 2\), such that the vertices of a batch are presented as a set, and must be colored before the vertices of the next batch are presented. This last model is an intermediate model, which bridges between the two extreme scenarios of the online and offline models. We provide several results, including a general result for sum coloring and results for the classic graph coloring problem on restricted graph classes: We show tight bounds for any graph class containing trees as a subclass (forests, bipartite graphs, planar graphs, and perfect graphs, for example), and an interesting result for interval graphs and \(k=2\), where the value of the (strict and asymptotic) competitive ratio depends on whether the graph is presented with its interval representation or not.


Online algorithms Graph coloring Batches Interval graphs Sum coloring 



Funding was provided by Natur og Univers, Det Frie Forskningsråd (Grant No. DFF-1323-00247), Villum Fonden (Grant No. VKR023219).


  1. 1.
    Albers, S., Schraink, S.: Tight bounds for online coloring of basic graph classes. In: 25th Annual European Symposium on Algorithms (ESA). LIPIcs, vol. 87, pp. 7:1–7:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Germany (2017)Google Scholar
  2. 2.
    Balogh, J., Békési, J., Dósa, G., Galambos, G., Tan, Z.: Lower bound for 3-batched bin packing. Discrete Optim. 21, 14–24 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Balogh, J., Békési, J., Galambos, G., Markót, M.C.: Improved lower bounds for semi-online bin packing problems. Computing 84(1–2), 139–148 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bar-Noy, A., Bellare, M., Halldórsson, M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140, 183–202 (1998)Google Scholar
  5. 5.
    Biró, M.: Precoloring extension. I. Interval graphs. Discrete Math. 100(1–3), 267–279 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Borodin, A., Ivan, I., Ye, Y., Zimny, B.: On sum coloring and sum multi-coloring for restricted families of graphs. Theor. Comput. Sci. 418, 1–13 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Dósa, G.: Batched bin packing revisited. J. Sched. 20, 199–209 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Epstein, L.: More on batched bin packing. Oper. Res. Lett. 44, 273–277 (2016)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Cambridge (1980)zbMATHGoogle Scholar
  10. 10.
    Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Gutin, G., Jensen, T., Yeo, A.: Batched bin packing. Discrete Optim. 2, 71–82 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Gyárfás, A., Lehel, J.: On-line and First-Fit colorings of graphs. J. Graph Theory 12, 217–227 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Gyárfás, A., Lehel, J.: First fit and on-line chromatic number of families of graphs. ARS Comb. 29(C), 168–176 (1990)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Halldórsson, M.M.: Online coloring known graphs. Electron. J. Comb. 7, R7 (2000)Google Scholar
  15. 15.
    Halldórsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theor. Comput. Sci. 130(1), 163–174 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Kierstead, H.A., Smith, D.A., Trotter, W.T.: First-fit coloring on interval graphs has performance ratio at least 5. Eur. J. Comb. 51, 236–254 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congr. Numerantium 33, 143–153 (1981)MathSciNetzbMATHGoogle Scholar
  18. 18.
    Kubicka, E.: The chromatic sum of a graph: History and recent developments. Int. J. Math. Math. Sci. 2004(30), 1563–1573 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: 17th ACM Computer Science Conference. ACM Press, pp. 39–45 (1989)Google Scholar
  20. 20.
    Narayanaswamy, N.S., Babu, R.S.: A note on First-Fit coloring of interval graphs. Order 25(1), 49–53 (2008)Google Scholar
  21. 21.
    Nicolosoi, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica 23(2), 109–126 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Szkaliczki, T.: Routing with minimum wire length in the dogleg-free Manhattan model is NP-complete. SIAM J. Comput. 29(1), 274–287 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Zhang, G., Cai, X., Wong, C.K.: Scheduling two groups of jobs with incomplete information. J. Syst. Sci. Syst. Eng. 12, 73–81 (2003)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceUniversity of Southern DenmarkOdenseDenmark
  2. 2.Department of MathematicsUniversity of HaifaHaifaIsrael
  3. 3.Faculty of IE&MThe TechnionHaifaIsrael

Personalised recommendations