Abstract
It is well known that any set of n intervals in R1 admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces.
Original language | English |
---|---|
Pages (from-to) | 1081-1100 |
Number of pages | 20 |
Journal | Algorithmica |
Volume | 82 |
Issue number | 5 |
Early online date | 31 Oct 2019 |
DOIs | |
Publication status | Published - 1 May 2020 |
Keywords
- Conflict-free coloring
- Non-monochromatic coloring
- Planar networks
- Tree