The harmonious chromatic number of a complete binary and trinary tree
From MaRDI portal
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.
Recommendations
Cites work
- An upper bound for the harmonious chromatic number of a graph
- scientific article; zbMATH DE number 3795986 (Why is no real title available?)
- On the harmonious chromatic number of a graph
- On the Harmonious Coloring of Graphs
- The growth rate of the harmonious chromatic number
- The harmonious coloring number of a graph
Cited in
(8)- The harmonious chromatic number of complete \(r\)-ary trees
- The exact value of the harmonious chromatic number of a complete binary tree
- scientific article; zbMATH DE number 1159282 (Why is no real title available?)
- scientific article; zbMATH DE number 4114662 (Why is no real title available?)
- The Harmonious Chromatic Number of Almost All Trees
- scientific article; zbMATH DE number 975344 (Why is no real title available?)
- scientific article; zbMATH DE number 2230305 (Why is no real title available?)
- On the harmonious chromatic number of graphs
This page was built for publication: The harmonious chromatic number of a complete binary and trinary tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685580)