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

DOI10.1007/978-3-319-94776-1_47arXiv1805.02538MaRDI QIDQ6301271FDOQ6301271

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

Publication date: 7 May 2018

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.

Mathematics Subject Classification ID

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

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)