Edge Game Coloring of Graphs

Abstract

Corresponding to the game chromatic number of graphs, we consider in this paper the game chromatic index Ø 0 g of graphs, which is defined similarly, except that edges, instead of vertices of graphs are colored. Upper bounds for trees and wheels are given