A self-stabilizing algorithm for coloring bipartite graphs
The term self-stabilizing was introduced by \textit{E. W. Dijkstra} [Commun. ACM 17, 643-644 (1974; Zbl 0305.68048)]. The authors present a self- stabilizing algorithm for vertex coloring bipartite graphs. They also illustrate the execution of the algorithm on an example of \(K_{4,4}\).
scientific article; zbMATH DE number 220437