Game matching number of graphs
From MaRDI portal
Publication:2446826
DOI10.1016/j.dam.2013.03.010zbMath1286.05133arXiv1208.0085MaRDI QIDQ2446826
Douglas B. West, Suil O, Daniel W. Cranston, William B. Kinnersley
Publication date: 22 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.0085
05C35: Extremal problems in graph theory
90C47: Minimax problems in mathematical programming
91A05: 2-person games
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C57: Games on graphs (graph-theoretic aspects)
Related Items
The Game Saturation Number of a Graph, Paired-Domination Game Played in Graphs, Game brush number, Bounds on the game transversal number in hypergraphs, On saturation games, The generalized matcher game, An upper bound on the extremal version of Hajnal's triangle-free game, The matcher game played in graphs, Domination game on uniform hypergraphs, Game saturation of intersecting families, Saturation games for odd cycles, Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game, Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
Cites Work
- Connected, bounded degree, triangle avoidance games
- Fast winning strategies in avoider-enforcer games
- On n-extendable graphs
- On Hajnal's triangle-free game
- Subtrees and subforests of graphs
- Tight bounds on maximal and maximum matchings
- Bounded degree, triangle avoidance graph games
- Tight lower bounds on the size of a maximum matching in a regular graph
- The first player wins the one-colour triangle avoidance game on 16 vertices
- Winning Fast in Sparse Graph Construction Games
- Planarity, Colorability, and Minor Games
- A Problem in Graph Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
