Asymmetric marking games on line graphs

作者：Yang Daqing^*; Kierstead H A

来源：Discrete Mathematics, 2008, 308(9): 1751-1755.

DOI：10.1016/j.disc.2007.03.082

• game coloring number
• line graph
• Harmonious strategy

This paper investigates the asymmetric marking games on line graphs. Suppose G is a graph with maximum degree Delta and G has an orientation with maximum outdegree k, we show that the (a,1)-game coloring number of the line graph of G is at most Delta + 2k + [k/a] - 1. When a = 1, this improves some known results of the game coloring number of the line graphs.

• 出版日期2008-5-6
• 单位福州大学