An upper bound for the harmonious chromatic number of a graph (Q3795694)

From MaRDI portal
Revision as of 01:33, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An upper bound for the harmonious chromatic number of a graph
scientific article

    Statements

    An upper bound for the harmonious chromatic number of a graph (English)
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    harmonious chromatic number
    0 references
    n-dimensional cube
    0 references
    Cartesian product
    0 references
    complete binary tree
    0 references
    0 references