The Gamma-Theta Conjecture holds for planar graphs
Abstract
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 Ck-free graphs, where k ∈ \3,4\. In this paper, we prove the Conjecture for the class of planar graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.