Dominating sets in plane triangulations

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