On the harmonious chromatic number of a graph

DOI10.1016/0012-365X(89)90207-0zbMath0681.05030WikidataQ56390754 ScholiaQ56390754MaRDI QIDQ1823253

John Mitchem

Publication date: 1989

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

zbMATH Keywords

harmonious chromatic numbervertex colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs ⋮ The exact value of the harmonious chromatic number of a complete binary tree ⋮ The Harmonious Chromatic Number of Almost All Trees ⋮ The harmonious chromatic number of a complete binary and trinary tree ⋮ Unnamed Item ⋮ The harmonious chromatic number of complete \(r\)-ary trees

Cites Work

• On the Harmonious Coloring of Graphs
• An upper bound for the harmonious chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the harmonious chromatic number of a graph