Domination conjecture for triangulations with finitely many non-six-valent vertices

A triangulation is a plane graph in which every face, including the outer face, is bounded by a triangle. The degree of a vertex is its number of incident edges. The bounded-exception domination conjecture. For every constant $t$, there exists an integer $n_t$ such that every $n$-vertex triangulation with at most $t$ vertices whose degree is not $6$, and with $n\geq n_t$, has a dominating set of size at most $n/4$. This extends the paper's maximum-degree-six result to triangulations that are degree six except at a bounded number of vertices; the supplied text does not resolve it.