The Harmonious Chromatic Number of Bounded Degree Trees

DOI10.1017/S0963548300001802zbMath0849.05029OpenAlexW2001298838WikidataQ56390767 ScholiaQ56390767MaRDI QIDQ4883059

Keith J. Edwards

Publication date: 1 July 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300001802

zbMATH Keywords

treepolynomial-time algorithmharmonious chromatic numbermaximum degreeharmonious coloring

Mathematics Subject Classification ID

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

Related Items (4)

Harmonious coloring: parameterized algorithms and upper bounds ⋮ Harmonious Coloring: Parameterized Algorithms and Upper Bounds ⋮ Efficient approximation algorithms for the achromatic number ⋮ The achromatic number of bounded degree trees

Cites Work

• The harmonious coloring number of a graph
• The complexity of harmonious colouring for trees
• On the Harmonious Coloring of Graphs
• Bounds for the harmonious chromatic number of a graph
• New upper bounds on harmonious colorings
• The Harmonious Chromatic Number of Almost All Trees

This page was built for publication: The Harmonious Chromatic Number of Bounded Degree Trees