Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

Harmonious Colourings and Achromatic Number

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://www.mcs.dundee.ac.uk:8080/~kedwards/harmcol.html
Author:Keith Edwards; Department of Applied Computing, University of Dundee
Description: 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.
Levels: College, Research
Languages: English
Resource Types: Bibliographies
Math Topics: Graph Theory

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.