Dominating sets in plane triangulations

In 1996, Matheson and Tarjan conjectured that any n -vertex plane triangulation with n sufficiently large has a dominating set of size at most n / 4 . We prove this for graphs of maximum degree 6.