Dawson's chess, snort on graphs and graph involutions.

Title: Dawson's chess, snort on graphs and graph involutions.
Identifier: AAI9820508
identifier: 9820508
Creator: Arroyo, Edward.
Contributor: Adviser: Michael Anshel
Date: 1998
Language: English
Publisher: City University of New York.
Subject: Mathematics
Abstract: We show that many 2-person graph vertex coloring games are equivalent to Achievement, a vertex coloring game introduced by Frank Harary and Zsolt Tuza. We then study classes of graphs that satisfy certain graph involutions and show that these involutions can be used to develop winning strategies for these games. Many classes of graphs possess such involutions including Cayley graphs and generalized Kneser graphs. We also study misere versions of these games for special classes of graphs.
Type: dissertation
Source: PQT Legacy CUNY.xlsx
degree: Ph.D.