Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Edge Coloring Of Split Graphs
Author: Almeida S.M.
de Mello C.P.
Morgana A.
Abstract: A split graph is a graph whose vertex set admits a partition into a stable set and a clique. The chromatic indexes for some subsets of split graphs, such as split graphs with odd maximum degree and split-indifference graphs, are known. However, for the general class, the problem remains unsolved. This paper presents new results about the classification problem for split graphs as a contribution in the direction of solving the entire problem for this class. © 2008 Elsevier B.V. All rights reserved.
Rights: fechado
Identifier DOI: 10.1016/j.endm.2008.01.005
Date Issue: 2008
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-39149083038.pdf197.58 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.