Strong coloring
= Strong coloring
{wiki=Strong_coloring}
In graph theory, **strong coloring** refers to a specific way of coloring the vertices of a graph such that no two adjacent vertices can share the same color and that no vertex can be colored the same as any vertex to which it is connected by a two-edge path (i.e., a path involving two edges). This means that each vertex must be colored differently from those that are one or two edges away from it.