Game matching number of graphs
Authors:
- Daniel W. CranstonDCDaniel W. Cranston
- William B. KinnersleyWKWilliam B. Kinnersley
- Suil OSOSuil O
- Douglas B. WestDWDouglas B. West
- 1 September 2013
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (13-14) , 1828-1836
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation (DMS 08-38434)
- National Security Agency (H98230-10-1-0363)
This publication has 12 references indexed in Scilit:
- The first player wins the one-colour triangle avoidance game on 16 verticesDiscussiones Mathematicae Graph Theory, 2012
- Fast Winning Strategies in Avoider-Enforcer GamesGraphs and Combinatorics, 2009
- Winning Fast in Sparse Graph Construction GamesCombinatorics, Probability and Computing, 2008
- Planarity, Colorability, and Minor GamesSIAM Journal on Discrete Mathematics, 2008
- Tight Lower Bounds on the Size of a Maximum Matching in a Regular GraphGraphs and Combinatorics, 2007
- Tight bounds on maximal and maximum matchingsDiscrete Mathematics, 2004
- Subtrees and Subforests of GraphsJournal of Combinatorial Theory, Series B, 1994
- On Hajnal's triangle-free gameGraphs and Combinatorics, 1992
- On n-extendable graphsDiscrete Mathematics, 1980
- A Problem in Graph TheoryThe American Mathematical Monthly, 1964