Premium
An upper bound for the harmonious chromatic number of a graph
Author(s) -
Lee SinMin,
Mitchem John
Publication year - 1987
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190110414
Subject(s) - mathematics , chromatic scale , combinatorics , upper and lower bounds , graph , windmill graph , friendship graph , discrete mathematics , line graph , voltage graph , mathematical analysis
An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom