On harmonious colouring of C(W_n) and C(F_m,n)

DOI10.1016/J.ENDM.2009.03.014MaRDI QIDQ2839246zbMATH OpenOpenAlexFDO

Authors K. Thilagavathi, D. Nidha, N. Roopesh

Publication date 4 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.03.014

zbMATH Keywords

central graphFan graphharmonious colouringwheel graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• A new upper bound for the harmonious chromatic number
• Graph theory with applications
• Handbook of Graph Theory
• Harmonious colouring of graphs
• Methods of destroying the symmetries of a graph
• On harmonious colouring of central graphs
• The Harmonious Chromatic Number of Bounded Degree Graphs

Cited in

(1)

• scientific article; zbMATH DE number 5856652 (Why is no real title available?)

This page was built for publication: On harmonious colouring of \(C(W_n)\) and \(C(F_{m,n})\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2839246)