@inbook{03c492a76f53447cbe7639b82c5cbd4e,
title = "The harmonious chromatic number and the achromatic number",
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.",
author = "Keith Edwards",
year = "1997",
doi = "10.1017/CBO9780511662119.003",
language = "English",
isbn = "0521598400",
series = "London Mathematical Society Lecture Note Series",
publisher = "Cambridge University Press",
pages = "13--48",
editor = "Bailey, {R. A.}",
booktitle = "Surveys in combinatorics, 1997",
address = "United Kingdom",
}