The harmonious chromatic number and the achromatic number

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Abstract

    The harmonious chromatic number of a graph is the least number of colours in a vertex colouring such that each pair of colours appears on at most one edge. The achromatic number of a graph is the greatest number of colours in a vertex colouring such that each pair of colours appears on at least one edge. This paper is a survey of what is known about these two parameters, in particular we look at upper and lower bounds, special classes of graphs and complexity issues.
    Original languageEnglish
    Title of host publicationSurveys in combinatorics, 1997
    EditorsR. A. Bailey
    PublisherCambridge University Press
    Pages13-48
    Number of pages36
    ISBN (Electronic)9780511662119
    ISBN (Print)0521598400
    DOIs
    Publication statusPublished - 1997

    Publication series

    NameLondon Mathematical Society Lecture Note Series
    Volume241

    Fingerprint Dive into the research topics of 'The harmonious chromatic number and the achromatic number'. Together they form a unique fingerprint.

    Cite this