Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces

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

Research output: Contribution to journalArticleAcademic

16 Downloads (Pure)

Abstract

It is well known that any set of n intervals in R1 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.
Original languageEnglish
Article number1805.02538vl
Number of pages15
JournalarXiv
Publication statusPublished - 7 May 2018

Fingerprint Dive into the research topics of 'Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces'. Together they form a unique fingerprint.

Cite this