The Harmonious Chromatic Number of Almost All Trees
From MaRDI portal
Publication:4844488
DOI10.1017/S0963548300001462zbMATH Open0842.05033MaRDI QIDQ4844488FDOQ4844488
Authors: Keith Edwards 
Publication date: 17 July 1996
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
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
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)
Cites Work
- The number of trees
- The distribution of degrees in a large random tree
- On the Harmonious Coloring of Graphs
- An asymptotic evaluation of the cycle index of a symmetric group
- New upper bounds on harmonious colorings
- The harmonious coloring number of a graph
- On the harmonious chromatic number of a graph
- The harmonious chromatic number of a complete binary and trinary tree
- Unlabeled trees: Distribution of the maximum degree
Cited In (7)
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)
