Discrete Applied Mathematics
| Hi-index | 0.00 |
This paper is concerned with algorithms and complexity results for defective coloring, where a defective (k,d)-coloring is a k coloring of the vertices of a graph such that each vertex is adjacent to at most d-self-colored neighbors. First, (2,d) coloring is shown NP-complete for d