Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces
Discrete Mathematics
2018-05-08 v1 Computational Geometry
Combinatorics
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.
Keywords
Cite
@article{arxiv.1805.02538,
title = {Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces},
author = {Boris Aronov and Mark de Berg and Aleksandar Markovic and Gerhard Woeginger},
journal= {arXiv preprint arXiv:1805.02538},
year = {2018}
}