×

zbMATH — the first resource for mathematics

On the edge coloring of graph products. (English) Zbl 1085.05029
Summary: The edge chromatic number of a graph \(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 determine a sufficient condition for various graph products to be of class 1, namely, strong product, semistrong product, and special product.
MSC:
05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite
Full Text: DOI EuDML