Strong Conflict-Free Coloring for Intervals

DOI10.1007/978-3-642-35261-4_4zbMath1260.05158arXiv1205.1900OpenAlexW2179409935MaRDI QIDQ4909516

Adele A. Rescigno, Panagiotis Cheilaris, Luisa Gargano, Shakhar Smorodinsky

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.1900

zbMATH Keywords

strong conflict free coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On Conflict-Free Multi-coloring

This page was built for publication: Strong Conflict-Free Coloring for Intervals