On characterizing game-perfect graphs by forbidden induced subgraphs

A graph $G$ is called $g$-perfect if, for any induced subgraph $H$ of $G$, the game chromatic number of $H$ equals the clique number of $H$. A graph $G$ is called $g$-col-perfect if, for any induced subgraph $H$ of $G$, the game coloring number of $H$ equals the clique number of $H$. In this paper we characterize the classes of $g$-perfect resp. $g$-col-perfect graphs by a set of forbidden induced subgraphs and explicitly. Moreover, we study similar notions for variants of the game chromatic number, namely $B$-perfect and $[A,B]$-perfect graphs, and for several variants of the game coloring number, and characterize the classes of these graphs

Edge coloring of a graph

Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2004Includes bibliographical references (leaves: 35-36)Text in English; Abstract: Turkish and Englishviii, 36 leavesThe edge coloring problem is one of the fundamental problem on graphs which often appears in various scheduling problems like the le transfer problem on computer networks. In this thesis, we survey old and new results on the classical edge coloring as well as the generalized edge coloring problems. In addition, we developed some algorithms and modules by using Combinatorica package to color the edges of graphs with webMathematica which is the new web-based technology

The game chromatic index of wheels

We prove that the game chromatic index of n-wheels is n for n ≥ 6