Graph Unique-Maximum and Conflict-Free Colorings
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.
Unable to display preview. Download preview PDF.
- 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.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
- 5.Cheilaris, P., Tóth, G.: Graph unique-maximum and conflict-free colorings. CoRR abs/0912.3004 (2009)Google Scholar
- 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
- 15.Pothen, A.: The complexity of optimal elimination trees. Tech. Rep. CS-88-16, Department of Computer Science, Pennsylvania State University (1988)Google Scholar