Graph Unique-Maximum and Conflict-Free Colorings

  • Panagiotis Cheilaris
  • Géza Tóth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6078)

Abstract

We investigate the relationship between two kinds of vertex colorings of graphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every path of the graph the maximum color appears only once. In a conflict-free coloring, in every path of the graph there is a color that appears only once. We also study computational complexity aspects of conflict-free colorings and prove a completeness result. Finally, we improve lower bounds for those chromatic numbers of the grid graph.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bar-Noy, A., Cheilaris, P., Lampis, M., Mitsou, V., Zachos, S.: Ordered coloring of grids and related graphs. Submitted to a journal (2009)Google Scholar
  2. 2.
    Bar-Noy, A., Cheilaris, P., Smorodinsky, S.: Deterministic conflict-free coloring for intervals: from offline to online. ACM Transactions on Algorithms 4(4), 44:1–44:18 (2008)Google Scholar
  3. 3.
    Bodlaender, H.L., Deogun, J.S., Jansen, K., Kloks, T., Kratsch, D., Müller, H., Tuza, Z.: Rankings of graphs. SIAM Journal on Discrete Mathematics 11(1), 168–181 (1998)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Journal of Algorithms 18(2), 238–255 (1995)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Cheilaris, P., Tóth, G.: Graph unique-maximum and conflict-free colorings. CoRR abs/0912.3004 (2009)Google Scholar
  6. 6.
    Chen, K., Fiat, A., Kaplan, H., Levy, M., Matoušek, J., Mossel, E., Pach, J., Sharir, M., Smorodinsky, S., Wagner, U., Welzl, E.: Online conflict-free coloring for intervals. SIAM Journal on Computing 36(5), 1342–1359 (2007)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Elbassioni, K., Mustafa, N.H.: Conflict-free colorings of rectangles ranges. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 254–263. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM Journal on Computing 33, 94–136 (2003)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Iyer, A.V., Ratliff, H.R., Vijayan, G.: Optimal node ranking of trees. Information Processing Letters 28, 225–229 (1988)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Katchalski, M., McCuaig, W., Seager, S.: Ordered colourings. Discrete Mathematics 142, 141–154 (1995)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 270–281 (1980)Google Scholar
  12. 12.
    Liu, J.W.: The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications 11(1), 134–172 (1990)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Pach, J., Tóth, G.: Conflict free colorings. In: Discrete and Computational Geometry, The Goodman-Pollack Festschrift, pp. 665–671. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  14. 14.
    Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1993)MATHGoogle Scholar
  15. 15.
    Pothen, A.: The complexity of optimal elimination trees. Tech. Rep. CS-88-16, Department of Computer Science, Pennsylvania State University (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Panagiotis Cheilaris
    • 1
  • Géza Tóth
    • 2
  1. 1.Center for Advanced Studies in MathematicsBen-Gurion UniversityIsrael
  2. 2.Rényi Institute, Hungarian Academy of SciencesHungary

Personalised recommendations