Dominating sets in plane triangulations (Q708360)

A dominating set \(D \subseteq V\) of a graph \(G(V,E)\) is a set such that each vertex \(v \in V\) is either in the set or is adjacent to a vertex in the set. The domination number of \(G\) denoted by \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\). In 1996, \textit{L.R. Matheson} and \textit{R.E. Tarjan} [``Dominating sets in planar graphs,'' Eur. J. Comb. 17, No.\,6, 565--568 (1996; Zbl 0862.05032)] considered this asymptotically for plane triangulations. They proved that any any triangulated disc \(G\) with \(n\) vertices has \(\gamma(G)\leq n/3\). They conjectured that this bound can be improved if the disc is bounded by a triangle. In this paper, the authors proves this conjecture for graphs of maximum degree 6.