### Abstract

Original language | English |
---|---|

Title of host publication | Surveys in combinatorics, 1997 |

Editors | R. A. Bailey |

Publisher | Cambridge University Press |

Pages | 13-48 |

Number of pages | 36 |

ISBN (Electronic) | 9780511662119 |

ISBN (Print) | 0521598400 |

DOIs | |

Publication status | Published - 1997 |

### Publication series

Name | London Mathematical Society Lecture Note Series |
---|---|

Volume | 241 |

### Fingerprint

### Cite this

*Surveys in combinatorics, 1997*(pp. 13-48). (London Mathematical Society Lecture Note Series; Vol. 241). Cambridge University Press. https://doi.org/10.1017/CBO9780511662119.003

}

*Surveys in combinatorics, 1997.*London Mathematical Society Lecture Note Series, vol. 241, Cambridge University Press, pp. 13-48. https://doi.org/10.1017/CBO9780511662119.003

**The harmonious chromatic number and the achromatic number.** / Edwards, Keith.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

TY - CHAP

T1 - The harmonious chromatic number and the achromatic number

AU - Edwards, Keith

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

U2 - 10.1017/CBO9780511662119.003

DO - 10.1017/CBO9780511662119.003

M3 - Chapter

SN - 0521598400

T3 - London Mathematical Society Lecture Note Series

SP - 13

EP - 48

BT - Surveys in combinatorics, 1997

A2 - Bailey, R. A.

PB - Cambridge University Press

ER -