A note on adjacent strong edge coloring of \(K(n,m)\) (Q2431949): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10255-006-0303-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010741452 / rank | |||
Normal rank | |||
Revision as of 00:35, 20 March 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
