Conflict-Free Coloring of Intersection Graphs
DOI10.1142/S0218195918500085zbMath1403.05045arXiv1709.03876MaRDI QIDQ4557736
Phillip Keldenich, Sándor P. Fekete
Publication date: 26 November 2018
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.03876
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Sphere and dot product representations of graphs
- Complexity of conflict-free colorings of graphs
- Strong conflict-free coloring for intervals
- Graph unique-maximum and conflict-free colorings
- How to draw a planar graph on a grid
- Conflict-free coloring of unit disks
- Conflict-free coloring of intersection graphs of geometric objects
- Conflict-free chromatic art gallery coverage
- Conflict-free coloring of points and simple regions in the plane
- Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs
- Minimum-weight triangulation is NP-hard
- Conflict-Free Colourings of Graphs and Hypergraphs
- Conflict-Free Coloring Made Stronger
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Three Colors Suffice: Conflict-Free Coloring of Planar Graphs
- Improved bounds for the conflict-free chromatic art gallery problem
- Online Conflict-Free Colouring for Hypergraphs
- The potential to improve the choice
- Conflict-Free Colouring of Graphs
- Online Conflict‐Free Coloring for Intervals
- Conflict-Free Colorings of Rectangles Ranges
This page was built for publication: Conflict-Free Coloring of Intersection Graphs
