Harmonious Colourings and Achromatic Number
Library Home || Full Table of Contents || Library Help
|Keith Edwards; Department of Applied Computing, University of Dundee|
|A vertex colouring of a graph is an assignment of a colours to the vertices, with the requirement that adjacent vertices receive distinct colours. A harmonious colouring is a vertex colouring with the added requirement that each pair of colours appears together on at most one edge. The harmonious chromatic number of a graph is the minimum number of colours in a harmonious colouring of the graph. Also Detachments and Exact Colourings. Includes a detailed bibliography.|
|Math Topics:||Graph Theory|
© 1994- The Math Forum at NCTM. All rights reserved.