Indexed by：
Abstract：
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. (c) 2007 Elsevier B.V. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
DISCRETE MATHEMATICS
ISSN： 0012-365X
Year： 2008
Issue： 9
Volume： 308
Page： 1751-1755
0 . 5 0 2
JCR@2008
0 . 7 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
JCR Journal Grade：3
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
