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...
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2018-04-17T19:40:12Z.
|
| Subjects: | |
| Online Access: | Get fulltext |