Harmonious colourings of graphs

DOI10.1016/j.dam.2016.09.017zbMath1358.05103OpenAlexW2523265125MaRDI QIDQ516809

Katarzyna Gibek, Ewa Drgas-Burchardt

Publication date: 15 March 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.09.017

zbMATH Keywords

graph polynomialsharmonious colouringsNordhaus-Gaddum type theorem

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On the complexity of generalized chromatic polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Harmonious coloring of trees with large maximum degree
• On harmonious colouring of trees
• NP-completeness results for some problems on subclasses of bipartite and chordal graphs
• The harmonious chromatic number of complete \(r\)-ary trees
• The complexity of harmonious colouring for trees
• The harmonious coloring problem is NP-complete for interval and permutation graphs
• ON HARMONIOUS COLORING OF TOTAL GRAPHS OF C(Cn), C(K1,n) AND C(Pn)
• On Complementary Graphs
• On the Harmonious Coloring of Graphs
• New upper bounds on harmonious colorings
• The Harmonious Chromatic Number of Almost All Trees
• Evaluations of Graph Polynomials

This page was built for publication: Harmonious colourings of graphs