Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces
2019
It is well known that any set of n intervals in \(\mathbb {R} ^1\) 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.
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
16
References
0
Citations
NaN
KQI