An upper bound for the harmonious chromatic number of a graph

DOI10.1002/jgt.3190110414zbMath0651.05034OpenAlexW2084286057MaRDI QIDQ3795694

Sin Min Lee, John Mitchem

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110414

zbMATH Keywords

Cartesian productharmonious chromatic numbercomplete binary treen-dimensional cube

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Bounds for the harmonious chromatic number of a graph ⋮ Euler cycles in the complete graph \(K_{2m+1}\) ⋮ The exact value of the harmonious chromatic number of a complete binary tree ⋮ The harmonious chromatic number of a complete binary and trinary tree ⋮ Fine-grained complexity of rainbow coloring and its variants ⋮ Three algorithms for graph locally harmonious colouring ⋮ On the harmonious chromatic number of a graph ⋮ Fine-Grained Complexity of Rainbow Coloring and its Variants.

This page was built for publication: An upper bound for the harmonious chromatic number of a graph