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.











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)