The Harmonious Chromatic Number of Bounded Degree Trees

DOI10.1017/S0963548300001802zbMATH Open0849.05029OpenAlexW2001298838WikidataQ56390767 ScholiaQ56390767MaRDI QIDQ4883059FDOQ4883059

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

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

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)

Cites Work

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

Cited In (14)

• The harmonious chromatic number of complete \(r\)-ary trees
• The achromatic number of bounded degree trees
• Title not available (Why is that?)
• Harmonious coloring of trees with large maximum degree
• On harmonious colouring of trees
• The Harmonious Chromatic Number of Bounded Degree Graphs
• On harmonious coloring of hypergraphs
• Harmonious coloring: parameterized algorithms and upper bounds
• 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)