Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces

DOI10.1007/978-3-319-94776-1_47MaRDI QIDQ6301271arXivFDO

Authors Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger

Publication date 7 May 2018

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Abstract: 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.

This page was built for publication: Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301271)