A new upper bound for the harmonious chromatic number

    Research output: Contribution to journalArticle

    6 Citations (Scopus)

    Abstract

    A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general graphs.
    Original languageEnglish
    Pages (from-to)257-261
    Number of pages5
    JournalJournal of Graph Theory
    Volume29
    Issue number4
    Publication statusPublished - 1998

    Fingerprint Dive into the research topics of 'A new upper bound for the harmonious chromatic number'. Together they form a unique fingerprint.

  • Cite this