A note on adjacent strong edge coloring of \(K(n,m)\) (Q2431949)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on adjacent strong edge coloring of K(n,m) |
scientific article; zbMATH DE number 5066752
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on adjacent strong edge coloring of \(K(n,m)\) |
scientific article; zbMATH DE number 5066752 |
Statements
A note on adjacent strong edge coloring of \(K(n,m)\) (English)
0 references
24 October 2006
0 references
We prove that the adjacent strong edge chromatic number of a graph \(K(n,m)\) is \(n+1\), with \(n\geq 2\), \(m\geq 1\).
0 references
0 references
