@article {IOPORT.05038587,
    author       = {Thilagavathi, K. and Vivin, J. Vernold},
    title        = {Harmonious colouring of graphs.},
    year         = {2006},
    journal      = {Far East Journal of Mathematical Sciences},
    volume       = {20},
    number       = {2},
    issn         = {0972-0871},
    pages        = {189-197},
    publisher    = {Pushpa Publishing House, Allahabad, Uttar Pradesh, India},
    abstract     = {By a harmonious colouring we mean a proper vertex colouring so that every pair of colours appears on at most one pair of adjacent vertices. The authors consider the harmonious chromatic number of complete graphs, complete bigraphs, the Haj\'os union of the middle, line graphs of crown graphs, cycles and some well-known graphs, respectively. The relationship between harmonious colouring and covering and harmonious colouring and matching are considered too.},
    reviewer     = {Jozef Fiam\v cik (Pre\v sov)},
    identifier   = {05038587},
}