Recommendations
Cites work
- scientific article; zbMATH DE number 6099774 (Why is no real title available?)
- scientific article; zbMATH DE number 125470 (Why is no real title available?)
- scientific article; zbMATH DE number 3795986 (Why is no real title available?)
- Evaluations of Graph Polynomials
- Harmonious coloring of trees with large maximum degree
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- New upper bounds on harmonious colorings
- On Complementary Graphs
- On harmonious coloring of total graphs of \(C(C_{n}), C(K_{1,n})\) and \(C(P_{n})\)
- On harmonious colouring of trees
- On the Harmonious Coloring of Graphs
- The Harmonious Chromatic Number of Almost All Trees
- The complexity of harmonious colouring for trees
- The harmonious chromatic number of complete \(r\)-ary trees
- The harmonious coloring problem is NP-complete for interval and permutation graphs
Cited in
(9)- scientific article; zbMATH DE number 800307 (Why is no real title available?)
- Amenable colorings
- Harmonious colorings of digraphs.
- scientific article; zbMATH DE number 5619926 (Why is no real title available?)
- Well-hued graphs
- Amenable colorings
- On the harmonious coloring of collections of graphs
- scientific article; zbMATH DE number 125470 (Why is no real title available?)
- On the complexity of generalized chromatic polynomials
This page was built for publication: Harmonious colourings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516809)
