A note on adjacent strong edge coloring of \(K(n,m)\) (Q2431949): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Jing-wen Li / rank
Normal rank
 
Property / author
 
Property / author: Zhong Fu Zhang / rank
Normal rank
 
Property / author
 
Property / author: Xiang'en Chen / rank
Normal rank
 

Revision as of 07:00, 11 February 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
    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

    Identifiers