The Harmonious Chromatic Number of Bounded Degree Trees

DOI10.1017/S0963548300001802MaRDI QIDQ4883059zbMATH OpenOpenAlexWikidataFDO

Authors Keith 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

treemaximum degreepolynomial-time algorithmharmonious coloringharmonious chromatic number

Mathematics Subject Classification ID

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

Recommendations

• Harmonious coloring of trees with large maximum degree
• The Harmonious Chromatic Number of Bounded Degree Graphs
• On harmonious colouring of trees
• The Harmonious Chromatic Number of Almost All Trees

Cites work

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

Cited in

(14)

• The harmonious chromatic number of complete \(r\)-ary trees
• The achromatic number of bounded degree trees
• Harmonious coloring of trees with large maximum degree
• On harmonious colouring of trees
• scientific article; zbMATH DE number 1159282 (Why is no real title available?)
• The Harmonious Chromatic Number of Bounded Degree Graphs
• Harmonious coloring: parameterized algorithms and upper bounds
• On harmonious coloring of hypergraphs
• Harmonious properties of uniform \(k\)-distant trees
• On graceful colorings of trees.
• Harmonious coloring: parameterized algorithms and upper bounds
• Efficient approximation algorithms for the achromatic number
• On the harmonious colouring of trees.
• The Harmonious Chromatic Number of Almost All Trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883059)