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

From MaRDI portal
Revision as of 00:35, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    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