%0 Journal Article
%T 乘积图的博弈染色数<br>The Game Coloring Number of Product Graph
%A 苏俊义
%J Advances in Applied Mathematics
%P 1504-1509
%@ 2324-8009
%D 2023
%I Hans Publishing
%R 10.12677/AAM.2023.124156
%X 本文讨论的图是两棵树的乘积图.  分别研究了树和树的笛卡尔积图、直积图和强积图的 (a, 1)-博弈染色数, 给出了三种乘积图的 (a, 1)-博弈染色的上界. 特殊地, 如果其中一棵树是一条路,  那么我们类似的可以得出关于树和路的乘积图的 (a, 1)-博弈染色数的结果.<br />
The graph discussed in this article is a product graph of two trees. We study the (a, 1)-game coloring numbers of the Cartesian product graph, direct product graph and strong product graphs of two trees, and give the upper bounds of (a, 1)-game coloring numbers of the three product graphs. In particular, if one of the trees is a path, then we can similarly obtain the results of the (a, 1)-game coloring number  of the product graph of tree and path.
%K 笛卡尔积图，直积图，强积图，博弈染色数<br>The Cartesian Product of Graphs
%K The Direct Product of Graphs
%K The Strong Product of Graphs
%K Game Coloring Number
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=64075