Abstract

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.

Copyright Hindawi Publishing Corporation. The ELibM mirror is published by FIZ Karlsruhe.