The Game Grundy Indices And The Game Chromatic Indices Of Graphs

This dissertation studies two graph coloring games, the greedy edge colouring game for forest, partial2-tree and outerplanar graph, and the edge-colouring game for forest with maximum degree4. This master thesis consists of three chapters:The first chapter introduces three games related to vertex colouring of graphs, background and previous results.The second chapter focus on the game Grundy index for forests with maximum degree△≥5, partial2-trees with△≥11and outerplanar graphs with△≥14, by using activation strategies.The third chapter we mainly discusses the game chromatic index of forests of maximum degree4in which every4-vertex is adjacent to at most one4-vertex.