Diagonal 11‐coloring of plane triangulations
Oleg Veniaminovich Borodin · Journal of Graph Theory · 1990
Abstract The vertices of each plane triangulation without loops and multiple edges may be colored with 11 colors so that for every two adjacent triangles [ xyz ] and [ wxy ], the vertices x , y , w , z are colored pairwise differently.