The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The harmonious coloring problem is NP-complete for interval and permutation graphs |
scientific article |
Statements
The harmonious coloring problem is NP-complete for interval and permutation graphs (English)
0 references
29 October 2007
0 references
harmonious coloring
0 references
harmonious chromatic number
0 references
achromatic number
0 references
interval graphs
0 references
permutation graphs
0 references
NP-completeness
0 references
0 references
