An upper bound for the harmonious chromatic number of a graph
From MaRDI portal
Publication:3795694
DOI10.1002/jgt.3190110414zbMath0651.05034MaRDI QIDQ3795694
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
Related Items
Bounds for the harmonious chromatic number of a graph, The harmonious chromatic number of a complete binary and trinary tree, Euler cycles in the complete graph \(K_{2m+1}\), The exact value of the harmonious chromatic number of a complete binary tree, On the harmonious chromatic number of a graph