文章基本信息

标题：On the edge coloring of graph products
本地全文：下载
作者：M. M. M. Jaradat
期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：2005
卷号：2005
DOI：10.1155/IJMMS.2005.2669
出版社：Hindawi Publishing Corporation
摘要：The edge chromatic number of G is the minimum number of colors required to color the edges of G in such a way that no two adjacent edges have the same color. We will determine a sufficient condition for a various graph products to be of class 1, namely, strong product, semistrong product, and special product.