Motivated by an application to load balancing in data-parallel finite element methods, we consider the following coloring question. Color an arbitrary, edge-to-edge triangulation T of a planar domain with two colors so that the largest connected group of same color triangles is as small as possible. We prove that it is always possible to have the largest such group containing at most two triangles and give an O(no. of triangles) algorithm for constructing the coloring. © 1994.
Jeurissen, R., & Layton, W. (1994). Load balancing by graph coloring, an algorithm. Computers and Mathematics with Applications, 27(3), 27–32. https://doi.org/10.1016/0898-1221(94)90043-4