TY - JOUR
T1 - Asymmetric marking games on line graphs
AU - Yang, Daqing
AU - Kierstead, Henry
N1 - Funding Information:
This research was partially supported by the Educational Department of Fujian Province of China under grant JA05181, and SRF for ROCS of SEM.
PY - 2008/5/6
Y1 - 2008/5/6
N2 - This paper investigates the asymmetric marking games on line graphs. Suppose G is a graph with maximum degree Δ 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 Δ + 2 k + ⌈ frac(k, a) ⌉ - 1. When a = 1, this improves some known results of the game coloring number of the line graphs.
AB - This paper investigates the asymmetric marking games on line graphs. Suppose G is a graph with maximum degree Δ 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 Δ + 2 k + ⌈ frac(k, a) ⌉ - 1. When a = 1, this improves some known results of the game coloring number of the line graphs.
KW - Game coloring number
KW - Harmonious strategy
KW - Line graph
UR - http://www.scopus.com/inward/record.url?scp=38949140904&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38949140904&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2007.03.082
DO - 10.1016/j.disc.2007.03.082
M3 - Article
AN - SCOPUS:38949140904
SN - 0012-365X
VL - 308
SP - 1751
EP - 1755
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 9
ER -