A proof of the 3/4 conjecture for the total domination game

2022/11/29 by Portier, Julien, Versteegen, Leo · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2211.16432

Abstract

In this paper we describe a strategy for Dominator that finishes the total domination game in at most 3/4n moves for every graph G on n vertices without any isolated vertices or edges, confirming the 3/4-conjecture for the total domination game made by Henning, Klavžar, and Rall.

Cited by

• Maker-Breaker total domination number

Related

• Progress Towards the Total Domination Game (3)/(4)-Conjecture
• A proof of the 3/5-conjecture in the domination game
• Progress towards the 1/2-Conjecture for the domination game
• On the game total domination number
• Indicated total domination game