The Harmonious Chromatic Number of Bounded Degree Graphs
From MaRDI portal
Recommendations
Cited in
(23)- On the harmonious chromatic number of a graph
- Complete colourings of hypergraphs
- Degree constrained subgraphs
- Vertex colouring edge partitions
- On harmonious colouring of \(C(W_n)\) and \(C(F_{m,n})\)
- Some results concerning the p-Royden and p-harmonic boundaries of a graph of bounded degree
- An upper bound for the harmonious chromatic number of a graph
- scientific article; zbMATH DE number 125470 (Why is no real title available?)
- Harmonious coloring of trees with large maximum degree
- On harmonious colouring of trees
- scientific article; zbMATH DE number 500379 (Why is no real title available?)
- Bounds for the harmonious chromatic number of a graph
- New upper bounds on harmonious colorings
- Achromatic and harmonious colorings of circulant graphs
- The growth rate of the harmonious chromatic number
- scientific article; zbMATH DE number 2104720 (Why is no real title available?)
- The Harmonious Chromatic Number of Almost All Trees
- The Harmonious Chromatic Number of Bounded Degree Trees
- Harmonious colouring of graphs
- Harmonious and achromatic colorings of fragmentable hypergraphs
- Harmonious and achromatic colorings of fragmentable hypergraphs
- Graphs of bounded degree and the \(p\)-harmonic boundary
- On harmonious coloring of hypergraphs
This page was built for publication: The Harmonious Chromatic Number of Bounded Degree Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4716669)
