Acyclic, k-intersection edge colourings and oriented colouring [HBNI Th 14]

DSpace/Manakin Repository

Acyclic, k-intersection edge colourings and oriented colouring [HBNI Th 14]

Show simple item record

dc.contributor.author Narayanan, N.
dc.date.accessioned 2010-02-09T08:59:37Z
dc.date.available 2010-02-09T08:59:37Z
dc.date.issued 2010-02-09T08:59:37Z
dc.date.submitted 2009
dc.identifier.uri http://hdl.handle.net/123456789/169
dc.description.abstract Three graph colouring problems are studied in this thesis with the main focus on 'acyclic edge colouring problem'. The first part of this thesis deals with some classes of graphs and improved upper bounds are obtained. The second part deals with k-intersection edge colouring. It aims to find the minimum number of colours that are sufficient to colour the edges such that for any pair of adjacent vertices, the number of common colours received on the edges incident on them is at most k. An upper bound of O(Delta^2 / k) is obtained and shown that this bound is tight for complete graphs. The oriented vertex colouring of graphs is focused in the third part of the thesis. An improved upper and lower bounds on oriented chromatic number for certain classes of graphs and products of graphs are obtained. en_US
dc.publisher.publisher
dc.subject Graph Colouring en_US
dc.subject HBNI Th 14 en_US
dc.title Acyclic, k-intersection edge colourings and oriented colouring [HBNI Th 14] en_US
dc.type.degree Ph.D en_US
dc.type.institution HBNI en_US
dc.description.advisor Subramanian, C.R.
dc.description.pages 95p. en_US
dc.type.mainsub Computer Science en_US

Files in this item

Files Size Format View
narayanan.pdf 977.4Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account