An upper bound for the harmonious chromatic number of a graph (Q3795694)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4061272
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the harmonious chromatic number of a graph |
scientific article; zbMATH DE number 4061272 |
Statements
An upper bound for the harmonious chromatic number of a graph (English)
0 references
1987
0 references
harmonious chromatic number
0 references
n-dimensional cube
0 references
Cartesian product
0 references
complete binary tree
0 references
0.936051070690155
0 references
0.9282749891281128
0 references
0.9117317199707032
0 references
0.9065021872520448
0 references
