ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Discrete Mathematics
Volume 151, Issues 1-3, 10 May 1996, Pages 113-119
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (298 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0012-365X(94)00089-2    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1996 Published by Elsevier Science B.V.

Edge-removing games of star type

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Mikio Kano

Department of Computer and Information Science, Faculty of Engineering, Ibaraki University, Hitachi 316, Japan


Received 2 December 1991; 
revised 29 September 1993. 
Available online 30 November 1999.

Abstract

We define a new game, which is called an edge-removing game of star type. This game is played by two players on a graph G. Each player in turn removes a set of edges which induces a star, and the player who removes the last edge wins. This game is a generalization of the game of classical Nim and classical Kayles since if we play this game on a graph consisting of stars or one consisting of paths, then this game is equivalent to the game of classical Nim or classical Kayles. We give some results on this game.

Article Outline

• References

Discrete Mathematics
Volume 151, Issues 1-3, 10 May 1996, Pages 113-119
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2009 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.