Asymptotic n/6 domination conjecture for degree-six triangulations

A triangulation is a plane graph in which every face, including the outer face, is bounded by a triangle. A dominating set of a graph is a set containing every vertex or a neighbor of every vertex. The n/6 domination conjecture. There exists a constant $c$ such that every $n$-vertex triangulation with maximum degree $6$ has a dominating set of size at most

$$n/6+c.$$

The paper presents this as a possible sharp strengthening of its proved $n/4$ bound for maximum-degree-six triangulations; its truth is not established in the supplied text.