β(d) equals specific small values for d ≤ 3 and satisfies β(d) ≥ 2^{d+1} + 2 for general d in the Maker-Breaker domination game on min-degree-d graphs.
Factors and factorizations of graphs: Proof techniques in factor theory
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The minimum degree question for the Maker Breaker Domination Game
β(d) equals specific small values for d ≤ 3 and satisfies β(d) ≥ 2^{d+1} + 2 for general d in the Maker-Breaker domination game on min-degree-d graphs.