Asymmetric marking games on line graphs

This paper investigates the asymmetric marking games on line graphs. Suppose G is a graph with maximum degree image and G has an orientation with maximum outdegree k, we show that the image-game coloring number of the line graph of G is at most image. When image, this improves some known results of the game coloring number of the line graphs.