#TITLE_ALTERNATIVE#

• Main Author: BAGUS GITA PRADNYANA (NIM : 10106005) Dosen Pembimbing : Dr. Hilda Assiyatun, IDA
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/15975
• Institution: Institut Teknologi Bandung

Two players, namely Player A and Player B are playing vertex coloring game on a graph G, by choosing colors from the set of colors (1,2.....kg) Player A is aiming that all of the vertices can be colored, and Player B is <br /> <br /> <br /> trying to prevent this. The players turn alternately, where Player A is the first player who starts to play the game. The only rule they must obey is to color the vertex with a color different from all the colors appeared in its neighborhood. If all the vertices are colored, Player A wins. Otherwise, if there exists a vertex that cannot be colored, Player B wins. The smallest k in which Player A has a strategy to win is called the game chromatic number of G, denoted by Xg(G). <br /> <br /> <br /> In this final project, it is determined the game chromatic number of certain classes of graphs, such as paths (Pn), cycles (Cn), stars (Sn), wheels (Wn), and ladders (Ln). Aside from that, vertex-amalgamation operations are done to all respective graph classes. In the new graph classes, which are the results of the vertex-amalgamation, the game chromatic number are also <br /> <br /> <br /> determined. <br />