Abstract
A proper coloring of a graph G is equitable if the sizes of any two color classes differ by at most one. A proper coloring is ℓ-bounded, when each color class has size at most ℓ. We consider the problems to determine for a given graph G (and a given integer ℓ) whether G has an equitable (ℓ-bounded) k-coloring. We prove that both problems can be solved in polynomial time on graphs of bounded treewidth, and show that a precolored version remains NP-complete on trees.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alon, N.: A note on the decomposition of graphs into isomorphic matchings. Acta Math. Hungar. 42, 221–223 (1983)
Baker, B.S., Coffman Jr., E.G.: Mutual exclusion scheduling. Theoret. Comput. Sci. 162, 225–243 (1996)
Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Weglarz, Scheduling Computer and Manufacturing Processes, 2nd edn. Springer, Berlin (2001)
Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. I. Theoret. Comput. Sci. 148, 93–109 (1995)
Bollobás, B., Guy, R.K.: Equitable and proportional coloring of trees. J. Combin. Theory Ser. B 34, 177–186 (1983)
Borie, R.B.: Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs. Algorithmica 14, 123–137 (1995)
Chang, G.J., Kuo, D.: The L(2, 1)-labeling problem on graphs. SIAM J. Discrete Math. 9, 309–316 (1996)
Chen, B.-L., Ko, M.-T., Lih, K.-W.: Equitable and m-bounded coloring of split graphs. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol. 1120, pp. 1–5. Springer, Heidelberg (1996)
Chen, B.-L., Lih, K.-W.: Equitable coloring of trees. J. Combin. Theory Ser. B 61, 83–87 (1994)
Cohen, E., Tarsi, M.: NP-completeness of graph decomposition problems. J. Complexity 7, 200–212 (1991)
Garey, M.R., Graham, R.L., Johnson, D.S., Knuth, D.E.: Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34, 477–495 (1978)
Garey, M.R., Johnson, D.S.: Computers and Intractability, A guide to the theory of NP-completeness. W. H. Freeman and Co., San Francisco (1979)
Hajnal, A., Szemerédi, E.: Proof of a conjecture of P. Erdös. In: Combinatorial theory and its applications, II, pp. 601–623. North-Holland, Amsterdam (1970)
Hansen, P., Hertz, A., Kuplinsky, J.: Bounded vertex colorings of graphs. Discrete Math. 111, 305–312 (1993)
Irani, S., Leung, V.: Scheduling with conflicts, and applications to traffic signal control. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), pp. 85–94. ACM, New York (1996)
Jansen, K.: The mutual exclusion scheduling problem for permutation and comparability graphs. Information and Computation 180, 71–81 (2003)
Jarvis, M., Zhou, B.: Bounded vertex coloring of trees. Discrete Math. 232, 145–151 (2001)
Kaller, D., Gupta, A., Shermer, T.: The χt-coloring problem. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 409–420. Springer, Heidelberg (1995)
Kitagawa, F., Ikeda, H.: An existential problem of a weight-controlled subset and its application to school timetable construction. Discrete Math. 72, 195–211 (1988)
Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126, 197–221 (2003)
Kostochka, V., Nakprasit, K., Pemmaraju, S.V.: Coloring ddegenarate graphs equitable. Manuscript submitted in November 2003
Krarup, J., de Werra, D.: Chromatic optimisation: limitations, objectives, uses, references. European J. Oper. Res. 11, 1–19 (1982)
Lih, K.-W.: The equitable coloring of graphs. In: Handbook of Combinatorial Optimization, vol. 3, pp. 543–566. Kluwer Acad. Publ., Boston (1998)
Lonc, Z.: On complexity of some chain and antichain partition problems. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol. 570, pp. 97–104. Springer, Heidelberg (1992)
Monien, B.: The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete. SIAM J. Algebraic Discrete Methods 7, 505–512 (1986)
Smith, B.F., Bjørstad, P.E., Gropp, W.D.: Domain Decomposition. Parallel multilevel methods for elliptic partial differential equations. Cambridge University Press, Cambridge (1996)
Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10, 529–550 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodlaender, H.L., Fomin, F.V. (2004). Equitable Colorings of Bounded Treewidth Graphs. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-28629-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22823-3
Online ISBN: 978-3-540-28629-5
eBook Packages: Springer Book Archive