1. Ajwani, D., Elbassioni, K., Govindarajan, S., Ray, S.: Conflict-free coloring for rectangle ranges using
$$O(n^.382)$$
colors. Discrete Comput. Geom. 48(1), 39–52 (2012)
2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)
3. Cheilaris, P., Tóth, G.: Graph unique-maximum and conflict-free colorings. J. Discrete Algorithms 9(3), 241–251 (2011)
4. Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. In: 2002 Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 691–700 (2002)
5. Texts in Theoretical Computer Science. An EATCS Series;J Flum,2006