Add to ORKGWe present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also consider "Fragmentable" classes of graphs (an example is the class of planar graphs) which are, roughly speaking, graphs which can be decomposed into bounded sized components by removing a small proportion of the vertices. We show that for such graphs of bounded degree the harmonious chromatic number is close to the lower bound (2m) 1 2, where m is the number of edges
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A detachment of a graph G is formed by splitting each vertex into one or more subvertices, and shari...
We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also...
We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also...
A harmonious colouring of a simple graph G is a colouring of the vertices such that adjacent vertice...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors ...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors ...
The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarm...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A detachment of a graph G is formed by splitting each vertex into one or more subvertices, and shari...
We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also...
We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also...
A harmonious colouring of a simple graph G is a colouring of the vertices such that adjacent vertice...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors ...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors ...
The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarm...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
A detachment of a graph G is formed by splitting each vertex into one or more subvertices, and shari...