On harmonious colouring of trees

zbMath1244.05083MaRDI QIDQ426747

Saieed Akbari, D. S. Eskandani, A. Aflaki, M. Jamaali, Keith J. Edwards, Hajar Ravanbod

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p3

zbMATH Keywords

harmonious chromatic number

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs ⋮ Harmonious coloring: parameterized algorithms and upper bounds ⋮ Harmonious Coloring: Parameterized Algorithms and Upper Bounds ⋮ Harmonious coloring of trees with large maximum degree ⋮ Harmonious colourings of graphs

This page was built for publication: On harmonious colouring of trees