3 papers
math.CO2026
On the minimum number of maximal distance- independent sets in trees
Dmitrii Taletskii
A vertex subset of a graph is called a distance- independent set if the distance between any two of its distinct vertices is at least . For all , we determine…
math.CO2024
The Gamma-Theta Conjecture holds for planar graphs
Dmitrii Taletskii
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 conj…
math.CO2023
Independent sets versus 4-dominating sets in outerplanar graphs
Dmitrii Taletskii
We show that the number of independent sets in every outerplanar graph is greater than the number of its 4-dominating sets.