A note on adjacent strong edge coloring of \(K(n,m)\) (Q2431949): Difference between revisions
From MaRDI portal
Latest revision as of 21:02, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on adjacent strong edge coloring of \(K(n,m)\) |
scientific article |
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
