Skip to main content
SpringerLink
Log in

Equitable Colorings of Bounded Treewidth Graphs

  • Conference paper
Mathematical Foundations of Computer Science 2004 (MFCS 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3153))

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.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N.: A note on the decomposition of graphs into isomorphic matchings. Acta Math. Hungar. 42, 221–223 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baker, B.S., Coffman Jr., E.G.: Mutual exclusion scheduling. Theoret. Comput. Sci. 162, 225–243 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Weglarz, Scheduling Computer and Manufacturing Processes, 2nd edn. Springer, Berlin (2001)

    Google Scholar 

  4. Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. I. Theoret. Comput. Sci. 148, 93–109 (1995)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Borie, R.B.: Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs. Algorithmica 14, 123–137 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chang, G.J., Kuo, D.: The L(2, 1)-labeling problem on graphs. SIAM J. Discrete Math. 9, 309–316 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Cohen, E., Tarsi, M.: NP-completeness of graph decomposition problems. J. Complexity 7, 200–212 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  11. 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)

    Article  MATH  MathSciNet  Google Scholar 

  12. 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)

    MATH  Google Scholar 

  13. 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)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. 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)

    Google Scholar 

  16. Jansen, K.: The mutual exclusion scheduling problem for permutation and comparability graphs. Information and Computation 180, 71–81 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Jarvis, M., Zhou, B.: Bounded vertex coloring of trees. Discrete Math. 232, 145–151 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  18. 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)

    Google Scholar 

  19. 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)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126, 197–221 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  21. Kostochka, V., Nakprasit, K., Pemmaraju, S.V.: Coloring ddegenarate graphs equitable. Manuscript submitted in November 2003

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  23. Lih, K.-W.: The equitable coloring of graphs. In: Handbook of Combinatorial Optimization, vol. 3, pp. 543–566. Kluwer Acad. Publ., Boston (1998)

    Google Scholar 

  24. 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)

    Google Scholar 

  25. Monien, B.: The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete. SIAM J. Algebraic Discrete Methods 7, 505–512 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  26. 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)

    MATH  Google Scholar 

  27. Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math. 10, 529–550 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information and Computing Sciences, Utrecht University, 3508 TA, Utrecht, The Netherlands

    Hans L. Bodlaender

  2. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    Fedor V. Fomin

Authors
  1. Hans L. Bodlaender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Malostranske nam. 25, 118 00, Praha1, Czech Republic

    Václav Koubek

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation