Edwards

Frank

Harary

Keith Edwards

Wilson

English

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 (*) S: m. We show that for almost all unlabelled, unrooted trees T, h(T) = Q(m), where m is the number of edges of T.Copyright © Cambridge University Press 199

Edwards, Keith

University of Dundee Online Publications

(to appear) The Complexity of Harmonious Colouring for Trees.

An Asymptotic Evaluation of the Cycle Index of a Symmetric Group.

For almost all trees T, the line-distinguishing chromatic number ld(T) of T is Q{m) — 1, where m is the number of edges of

Graphical Enumeration.

Line distinguishing and harmonious colourings.

New Upper Bounds on Harmonious Colorings.

On the harmonious chromatic number of a graph.

On the harmonious coloring of graphs.

The Distribution of Degrees in a Large Random Tree.

The harmonious chromatic number of a complete binary and trinary tree.

The harmonious colouring number of a graph.

The line-distinguishing chromatic number of a graph.

The number of trees.

Unlabelled Trees: Distribution of the Maximum Degree. Random Struct.

The harmonious chromatic number of almost all trees

Crossref

The Harmonious Chromatic Number of Almost All Trees

http://discovery.dundee.ac.uk/portal/files/4490588/aat.pdf

The harmonious chromatic number of almost all trees

Abstract

Similar works

Full text

Available Versions

University of Dundee Online Publications

University of Dundee Online Publications

Crossref