A note on adjacent strong edge coloring of \(K(n,m)\) (Q2431949): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the vertex-distinguishing proper edge-colorings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex-distinguishing proper edge-colorings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818315 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2720541 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the edge-binding number of some plane graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Adjacent strong edge coloring of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complete chromatic number of Halin graphs / rank | |||
Normal rank | |||
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
