Conflict-Free Coloring of Graphs

Conflict-Free Coloring of Graphs

A conflict-free k-coloring of a graph assigns one of k different colors to some of the vertices such that, for every vertex v, there is a color that is assigned to exactly one vertex among v and v's neighbors. Such colorings have applications in wireless networking, robotics, and geometry and a...

Full description

Bibliographic Details
Main Authors: Abel, Zachary R, Alvarez, Victor, Demaine, Erik D, Fekete, Sándor P., Gour, Aman, Hesterberg, Adam Classen, Keldenich, Phillip, Scheffer, Christian
Other Authors: Massachusetts Institute of Technology. Department of Mathematics
Format: Article
Language:English
Published: Society for Industrial & Applied Mathematics 2019
Online Access:https://hdl.handle.net/1721.1/122951

Internet

https://hdl.handle.net/1721.1/122951

Similar Items