Publication at Faculty of Mathematics and Physics |
2005
Abstract
We suppose that n points on the real line are inserted one by one, and each inserted points should be assigned one of k colors, so that at any moment the coloring of the already inserted points is conflict-free, that is, each interval with at least one point contains a point whose colors occurs exactly once in that interval. We investigate algorithms for such coloring, aiming at k as small as possible.