NotesFAQContact Us
Search Tips
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ781078
Record Type: Journal
Publication Date: 2008-Jan
Pages: 10
Abstractor: Author
Reference Count: 5
ISSN: ISSN-0020-739X
Analysis of a Game of Graph Solitaire
Hemasinha, R.
International Journal of Mathematical Education in Science and Technology, v39 n1 p132-141 Jan 2008
Let G be a simple undirected graph. To each vertex assign one of two colours say red or blue. A solitaire game is played on G as follows. A move consists of selecting a blue vertex, inverting the colours of its neighbours and then deleting the chosen vertex and all edges incident upon it. The goal is to delete all the vertices. The question of finding a winning strategy in the case when G is a simple cycle was proposed in the problems section of the "American Mathematical Monthly." In this article some general results on winning colour configurations are derived and the game is analysed for certain other graph classes. (Contains 6 figures.)
Taylor & Francis, Ltd. 325 Chestnut Street Suite 800, Philadelphia, PA 19106. Tel: 800-354-1420; Fax: 215-625-2940; Web site:
Publication Type: Journal Articles; Reports - Descriptive
Education Level: N/A
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A