Maker-Breaker total domination game on cubic graphs

DOI10.46298/dmtcs.8529zbMath1515.05127arXiv2010.03448OpenAlexW4293075412MaRDI QIDQ6045416

Mirjana Mikalački, Jovana Forcan

Publication date: 30 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.03448

zbMATH Keywords

cubic graphsgeneralized Petersen graphpositional gamestotal domination gamemaker-breaker game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

The maker-breaker largest connected subgraph game

Cites Work

• Unnamed Item
• Creating cycles in walker-breaker games
• The positive minimum degree game on sparse graphs
• The domination game played on unions of graphs
• Global maker-breaker games on sparse graphs
• Maker-Breaker domination game
• Some remarks on domination in cubic graphs
• Domination game played on trees and spanning subgraphs
• Partitioning the vertices of a cubic graph into two total dominating sets
• \( 1 / 2\)-conjectures on the domination game and claw-free graphs
• On the WalkerMaker-WalkerBreaker games
• Maker-breaker total domination game
• Maker-breaker domination number
• Fractional domination game
• Positional games
• Walker-Breaker Games
• Domination Game and an Imagination Strategy
• Asymptotic random graph intuition for the biased connectivity game
• The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
• Planarity, Colorability, and Minor Games
• Total domination in graphs
• Biased Positional Games
• Positional games on random graphs
• Combinatorial Games
• A theorem on tait colorings with an application to the generalized Petersen graphs
• On a combinatorial game

This page was built for publication: Maker-Breaker total domination game on cubic graphs