An upper bound for the harmonious chromatic number of a graph (Q3795694): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190110414 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084286057 / rank | |||
Normal rank | |||
Latest revision as of 01:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the harmonious chromatic number of a graph |
scientific article |
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
