Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces
International Computing and Combinatorics Conference, 2018•Springer
It is well known that any set of n intervals in 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.
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.
Abstract
It is well known that any set of n intervals in 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.
Springer