The harmonious chromatic number of a complete binary and trinary tree
type: Item
instance of: scholarly article
title: The harmonious chromatic number of a complete binary and trinary tree
zbMATH Open document ID: 0783.05050
DOI: 10.1016/0012-365X(93)90059-3
author: Zhikang Lu
published in: Discrete Mathematics
publication date: 1994-04-10T00:00:00Z
review text: The harmonious chromatic number of a graph \(G\), denoted by \(h(G)\), is the least number of colors which can be assigned to the vertices of \(G\) such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This paper improves J. Mitchem's result [Discrete Math. 74, No. 1/2, 151-157 (1989; Zbl 0681.05030)] on the harmonious chromatic number of a complete binary tree and discusses the same problem for a complete trinary tree.
reviewed by: Yanpei Liu
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 417453
zbMATH Keywords: harmonious chromatic number
zbMATH Keywords: binary tree
MaRDI profile type: Publication
cites work: The growth rate of the harmonious chromatic number
cites work: Q4740588
cites work: On the Harmonious Coloring of Graphs
cites work: An upper bound for the harmonious chromatic number of a graph
cites work: The harmonious coloring number of a graph
cites work: On the harmonious chromatic number of a graph
description: scientific article; zbMATH DE number 417453