On the edge coloring of graph products (Q2368384)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5019232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the edge coloring of graph products |
scientific article; zbMATH DE number 5019232 |
Statements
On the edge coloring of graph products (English)
0 references
19 April 2006
0 references
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.
0 references
chromatic number
0 references
colors
0 references
0.8457149863243103
0 references
0.8185132145881653
0 references
