Domination-packing conjecture for maximal outerplanar graphs

Let $G$ be a maximal outerplanar graph, and let $\gamma(G)$ and $\rho(G)$ denote its domination and packing numbers, respectively.

Maximal outerplanar domination-packing conjecture.

$$\gamma(G) \leq 2\rho(G).$$

The paper proves the weaker bound $\gamma(G)/\rho(G)\leq 3$ for maximal outerplanar graphs and proposes this inequality as a possible improvement of its method. Thus the stated bound remains open.