The Gamma-Theta Conjecture holds for planar graphs

The Gamma-Theta Conjecture states that if the domination number of a graph is equal to its eternal domination number, then it is also equal to its clique covering number. This conjecture is known to be true for several graph classes, such as outerplanar graphs, subcubic graphs and $C_k$-free graphs, where $k\in \{3,4\}$. In this paper, we prove the Conjecture for the class of planar graphs.