AbstractA 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. It was shown by Hopcroft and Krishnamoorthy (1983) that the problem of determining the harmonious chromatic number of a graph is NP-hard. We show here that the problem remains hard even when restricted to trees
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 colouring of a simple graph G is a proper vertex colouring such that each pair of colou...
AbstractA harmonious colouring of a simple graph G is a proper vertex colouring such that each pair ...
Let G be a simple graph and Delta(G) denote the maximum degree of G. A harmonious colouring of G is ...
Let G be a simple graph and Delta(G) denote the maximum degree of G. A harmonious colouring of G is ...
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...
AbstractHopcroft and Krishnamoorthy (1983) have shown that the harmonious coloring problem is NP-com...
A harmonious colouring of a simple graph G is a colouring of the vertices such that adjacent vertice...
AbstractThe harmonious chromatic number of a graph G, denoted by h(G), is the least number of colors...
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 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...
AbstractA harmonious colouring of a simple graph G is a proper vertex colouring such that each pair ...
Let G be a simple graph and Delta(G) denote the maximum degree of G. A harmonious colouring of G is ...
Let G be a simple graph and Delta(G) denote the maximum degree of G. A harmonious colouring of G is ...
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...
AbstractHopcroft and Krishnamoorthy (1983) have shown that the harmonious coloring problem is NP-com...
A harmonious colouring of a simple graph G is a colouring of the vertices such that adjacent vertice...
AbstractThe harmonious chromatic number of a graph G, denoted by h(G), is the least number of colors...
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...
DOI
Add to ORKG