Performing this process on the 2-dimensional plane is the subject of the Hadwiger-Nelson problem. Certain objects are partitioned into Class 1 and Class 2 by a variant of this process, according to Vizing’s Theorem. This process results in a value of delta-G in exactly 2 cases by Brooks’ Theorem. This process’s associated quantity is denoted chi, for which Hadwiger’s conjecture states that chi equals t implies a K-t minor. As this process amounts to a partition into independent sets, a value of 2 for that quantity implies (10[2])(*) bipartiteness. A conjecture about this process was resolved using discharging in a controversial (10[1])computer-assisted proof by (10[1])Appel and Haken. For 10 points, what process may be done using at most four labels without any adjacency conflicts, according to a namesake theorem about planar maps? ■END■