The Harmonious Chromatic Number of Almost All Trees
1995 ◽
Vol 4
(1)
◽
pp. 31-46
◽
Keyword(s):
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer m, let Q(m) be the least positive integer k such that ≥ m. We show that for almost all unlabelled, unrooted trees T, h(T) = Q(m), where m is the number of edges of T.
1996 ◽
Vol 5
(1)
◽
pp. 15-28
◽
Keyword(s):
2018 ◽
Vol 7
(4.10)
◽
pp. 393
Keyword(s):
Keyword(s):
2008 ◽
Vol 17
(2)
◽
pp. 265-270
◽
Keyword(s):
2001 ◽
Vol 10
(4)
◽
pp. 345-347
◽
Keyword(s):