Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||Decompositions For The Edge Colouring Of Reduced Indifference Graphs|
|Author:||De Figueiredo C.M.H.|
De Mello C.P.
|Abstract:||The chromatic index problem - finding the minimum number of colours required for colouring the edges of a graph - is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal clique are consecutive in this order. We present new positive evidence for the conjecture: every non neighbourhood-overfull indifference graph can be edge coloured with maximum degree colours. Two adjacent vertices are twins if they belong to the same maximal cliques. A graph is reduced if it contains no pair of twin vertices. A graph is overfull if the total number of edges is greater than the product of the maximum degree by ⌊n/2⌋, where n is the number of vertices. We give a structural characterization for neighbourhood-overfull indifference graphs proving that a reduced indifference graph cannot be neighbourhood-overfull. We show that the chromatic index for all reduced indifference graphs is the maximum degree. We present two decomposition methods for edge colouring reduced indifference graphs with maximum degree colours. © 2002 Elsevier Science B.V. All rights reserved.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.