The Harmonious Chromatic Number of Almost All Trees
From MaRDI portal
Publication:4844488
Recommendations
- The Harmonious Chromatic Number of Bounded Degree Trees
- The harmonious chromatic number of complete \(r\)-ary trees
- On the harmonious colouring of trees.
- On harmonious colouring of trees
- The Harmonious Chromatic Number of Bounded Degree Graphs
- The exact value of the harmonious chromatic number of a complete binary tree
- The harmonious chromatic number of a complete binary and trinary tree
- Harmonious coloring of trees with large maximum degree
- The complexity of harmonious colouring for trees
- An upper bound for the harmonious chromatic number of a graph
Cites work
- An asymptotic evaluation of the cycle index of a symmetric group
- New upper bounds on harmonious colorings
- On the Harmonious Coloring of Graphs
- On the harmonious chromatic number of a graph
- The distribution of degrees in a large random tree
- The harmonious chromatic number of a complete binary and trinary tree
- The harmonious coloring number of a graph
- The number of trees
- Unlabeled trees: Distribution of the maximum degree
Cited in
(9)- The Harmonious Chromatic Number of Bounded Degree Trees
- scientific article; zbMATH DE number 5492384 (Why is no real title available?)
- Harmonious coloring of trees with large maximum degree
- On harmonious colouring of trees
- Harmonious colourings of graphs
- The harmonious chromatic number of complete \(r\)-ary trees
- On the harmonious colouring of trees.
- scientific article; zbMATH DE number 1159282 (Why is no real title available?)
- Harmonious properties of uniform \(k\)-distant trees
This page was built for publication: The Harmonious Chromatic Number of Almost All Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4844488)