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 (Author), Alvarez, Victor (Author), Demaine, Erik D (Author), Fekete, Sándor P. (Author), Gour, Aman (Author), Hesterberg, Adam Classen (Author), Keldenich, Phillip (Author), Scheffer, Christian (Author)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor), Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Society for Industrial & Applied Mathematics, 2019-11-15T16:48:34Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items