On Distance Coloring


Call a connected undirected graph (d, c)-colorable if there is a vertex coloring using at most c colors such that no two vertices of distance d or less have the same color. It is well known that (1, 2)-colorability is decidable in linear time, but (1, c)-colorability for c ≥ 3 is NP-complete. In [19], Sharp shows that for fixed d ≥ 2, the (d, c… (More)


  • Presentations referencing similar topics