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

From MaRDI portal
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