On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph
M.Sc. === In this dissertation we study two types of colourings, namely line-distinguishing colourings and harmonious colourings. A line-distinguishing colouring of a graph G is a k-colouring of the vertices of G such that no two edges have the same colour. The line-distinguishing chromatic number ...
Published: |
2009
|
---|---|
Subjects: | |
Online Access: | http://hdl.handle.net/10210/2359 |