Conflict-Free Coloring for Intervals
Singhal, Vinay Kumar![Conflict-Free Coloring for Intervals](https://support.digitalhusky.com/media/annotations/sorted/447/44742677/CHSBZCOP0344742677.jpg)
A conflict-free k-coloring of a graph involves giving some of the vertices one of k different colours so that for each vertex v and each of v's neighbours, there is a colour that is given to exactly one vertex. Such colorings are extensively researched in graph theory and have applications in wireless networking, robotics, and geometry. Here, we look at the naturally occurring issue of the least k for which conflict-free k-colorings exist, the...