The complexity of harmonious colouring for trees (Q1346692): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q55966567, #quickstatements; #temporary_batch_1706081078495 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55966567 / rank | |||
Normal rank | |||
Revision as of 08:24, 24 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of harmonious colouring for trees |
scientific article |
Statements
The complexity of harmonious colouring for trees (English)
0 references
10 April 1995
0 references
A harmonious colouring of a simple graph is a proper vertex colouring such that each pair of colours appear together on at most one edge. It is shown in the paper that the problem of determining the least number of colours in a harmonious colouring of a tree is NP-hard.
0 references
complexity
0 references
harmonious colouring
0 references
number of colours
0 references
tree
0 references
