Harmonious colourings of graphs

DOI10.1016/J.DAM.2016.09.017zbMATH Open1358.05103OpenAlexW2523265125MaRDI QIDQ516809FDOQ516809

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

Recommendations

• scientific article
• scientific article
• An upper bound for the harmonious chromatic number of a graph
• Harmonious colouring of graphs
• Bounds for the harmonious chromatic number of a graph

zbMATH Keywords

graph polynomialsharmonious colouringsNordhaus-Gaddum type theorem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Title not available (Why is that?)
• Amenable colorings
• Harmonious colorings of digraphs.
• Title not available (Why is that?)
• Well-hued graphs
• Amenable colorings
• On the harmonious coloring of collections of graphs
• Title not available (Why is that?)
• 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)