The matcher game played in graphs

DOI10.1016/j.dam.2017.11.038zbMath1380.05128OpenAlexW2780191700MaRDI QIDQ1701097

Michael A. Henning, Wayne Goddard

Publication date: 22 February 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.11.038

zbMATH Keywords

matchingmatcher game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games on graphs (graph-theoretic aspects) (05C57) Density (toughness, etc.) (05C42)

Related Items

Paired-Domination Game Played in Graphs, The generalized matcher game

Cites Work

• Unnamed Item
• Bounds on the game transversal number in hypergraphs
• Game list colouring of graphs
• Extending matchings in graphs: A survey
• The 4/5 upper bound on the game total domination number
• Game matching number of graphs
• Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
• Domination Game and an Imagination Strategy
• Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Total Domination in Graphs
• Some Theorems on Abstract Graphs