A stable coloring for an iterative graph coloring refinement algorithm is a coloring whose partition into color classes is unchanged by one more refinement step. Equivalently, no color class splits further. The Weisfeiler-Leman algorithm terminates when it reaches such a coloring (Immerman and Sengupta 2019).
Stable Coloring
See also
Color Refinement, Graph Coloring, Weisfeiler-Leman AlgorithmExplore with Wolfram|Alpha
References
Immerman, N. and Sengupta, R. "The
-Dimensional Weisfeiler-Leman Algorithm." 22 Jul 2019.
https://arxiv.org/abs/1907.09582.
Cite this as:
Weisstein, Eric W. "Stable Coloring." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/StableColoring.html