中文摘要：

运用分析的方法，证明路与路的笛卡尔积图和路与圈的笛卡尔积图的集合边色数都是4，路与扇的笛卡尔积图的集合边色数等于图的最大度，同时提出一个猜想：任意图的笛卡尔积图的集合边色数都等于它的最大度。

英文摘要：

By the use of the method of analysis, it is shown that the set edge chromatic number of cartesian product of graphs of path and path is four, the set edge chromatic number of cartesian product of graphs of path and cycle is four, and the set edge chromatic number of cartesian product of graphs of path and fan is the maximum degree. Furthermore, a conjecture that the set edge chromatic number of every cartesian product of graphs＇ are maximum degree is also put forward.