Premium
Bounds for the harmonious chromatic number of a graph
Author(s) -
Krasikov I.,
Roditty Y.
Publication year - 1994
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.3190180212
Subject(s) - mathematics , chromatic scale , combinatorics , graph , upper and lower bounds , windmill graph , critical graph , friendship graph , graph theory , discrete mathematics , graph power , line graph , mathematical analysis
The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently ( Journal of Graph Theory , 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson ( Journal of Graph Theory , 1989, pp. 291–298) are improved.
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