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...
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: | |
Online Access: | Get fulltext |
Similar Items
-
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs
by: Abel, Zachary, et al.
Published: (2018) -
Closed quasigeodesics, escaping from polygons, and conflict-free graph coloring
by: Hesterberg, Adam Classen
Published: (2018) -
Reconfiguring Undirected Paths
by: Demaine, Erik D, et al.
Published: (2021) -
Decomposition, approximation, and coloring of odd-minor-free graphs
by: Demaine, Erik D., et al.
Published: (2011) -
Finding closed quasigeodesics on convex polyhedra
by: Demaine, Erik D, et al.
Published: (2021)