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

DOI10.1007/s00453-019-00639-9zbMath1436.05035OpenAlexW2799366259MaRDI QIDQ2309464

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

Publication date: 1 April 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-019-00639-9

zbMATH Keywords

treeconflict-free coloringplanar networksnon-monochromatic coloring

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Ordered colourings
• Conflict-free coloring of intersection graphs of geometric objects
• Geometry -- intuitive, discrete, and convex. A tribute to László Fejes Tóth
• Conflict-free coloring of points and simple regions in the plane
• Conflict-Free Colourings of Graphs and Hypergraphs
• On the chromatic number of some geometric hypergraphs
• A linear 5-coloring algorithm of planar graphs
• Rankings of Graphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Three Colors Suffice: Conflict-Free Coloring of Planar Graphs
• Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
• Online Conflict‐Free Coloring for Intervals

This page was built for publication: Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces