The harmonious chromatic number of complete \(r\)-ary trees

DOI10.1016/S0012-365X(99)00020-5zbMath0929.05028OpenAlexW2059850585MaRDI QIDQ1301657

Keith J. Edwards

Publication date: 5 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00020-5

zbMATH Keywords

treeharmonious chromatic numberharmonious colouring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs ⋮ Achromatic and Harmonious Colorings of Circulant Graphs ⋮ Harmonious colourings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The harmonious chromatic number of a complete binary and trinary tree
• The harmonious coloring number of a graph
• The complexity of harmonious colouring for trees
• On the harmonious chromatic number of a graph
• The Harmonious Chromatic Number of Almost All Trees

This page was built for publication: The harmonious chromatic number of complete \(r\)-ary trees