A new lower bound for the harmonious chromatic number

Duncan Campbell, Keith Edwards

    Research output: Contribution to journalArticle

    6 Citations (Scopus)

    Abstract

    A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring. We obtain a new lower bound for the harmonious chromatic number of general graphs, in terms of the independence number of the graph, generalizing results of Moser[2].
    Original languageEnglish
    Pages (from-to)99-102
    Number of pages4
    JournalAustralasian Journal of Combinatorics
    Volume29
    Publication statusPublished - 2004

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

  • Cite this