Three Colors Suffice: Conflict-Free Coloring of Planar Graphs

Three Colors Suffice: Conflict-Free Coloring of Planar 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...

Full description

Bibliographic Details
Main Authors: Abel, Zachary, Alvarez, Victor, Demaine, Erik D., Fekete, Sándor P., Gour, Aman, Hesterberg, Adam, Keldenich, Phillip, Scheffer, Christian
Other Authors: Massachusetts Institute of Technology. Department of Mathematics
Format: Article
Language:en_US
Published: 2018
Online Access:http://hdl.handle.net/1721.1/114769

Internet

http://hdl.handle.net/1721.1/114769

Similar Items