几类积图的强边着色  

Strong Edge Coloring of Some Product Graphs

作　　者：谢德政[1] 杨清军[1] 

机构地区：[1]重庆大学数理学院,重庆400030

出　　处：《重庆工学院学报（自然科学版）》2009年第4期30-33,共4页Journal of Chongqing Institute of Technology

摘　　要：图G的强边着色是指一个正常的边着色,同时对任意长为3的路上的边不能有相同的颜色.图G的强边色数是指在G的所有强边着色中所用色数的最小者.研究了几类积图的强边着色,并给出了相应图的精确的强边色数值.A strong edge-coloring of a graph is a proper edge-coloring, and no two edges with the same color lay on a path of length three. The strong chromatic index is the minimum number of colors that allow a strong edge-coloring. This paper considers some product graphs, and gives their precise strong chromatic index.

关 键 词：笛卡尔积图 网格 导出对集 强边色数 

分 类 号：O157.5[理学—数学]