List coloring;
Choice number;
On-line choosability;
Paintability;
Game coloring;
Lexicographic product;
D O I:
10.1016/j.dam.2017.02.008
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
This paper studies the choice number and paint number of the lexicographic product of graphs. We prove that if G has maximum degree 4, then for any graph H on n vertices ch(G[H]) <= (4 triangle + 2)(ch(H) + log(2) n) and X-p(G[H]) <= (4 triangle + 2)(X-P(1-1) + log(2) n). (C) 2017 Elsevier B.V. All rights reserved.
机构:
Xinjiang Normal Univ, Coll Math Sci, Urumqi 830054, Xinjiang, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
Zhang, Xindong
Liu, Juan
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
Xinjiang Normal Univ, Coll Math Sci, Urumqi 830054, Xinjiang, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China
Liu, Juan
Meng, Jixiang
论文数: 0引用数: 0
h-index: 0
机构:
Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R ChinaXinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Xinjiang, Peoples R China