Please use this identifier to cite or link to this item:
Type: Relatório
Title: Partitioning chordal graphs into independent sets and cliques
Author(s)/Inventor(s): Hell, Pavol
Klein, Sulamita
Nogueira, Loana Tito
Protti, Fábio
Abstract: We consider the following generalization of split graphs: A graph is said to be a (k,ℓ)-graph if its vertex set can be partitioned into k independent sets and ℓ cliques. (Split graphs are obtained by setting k=ℓ=1.) Much of the appeal of split graphs is due to the fact that they are chordal, a property not shared by (k,ℓ)-graphs in general. (For instance, being a (k,0)-graph is equivalent to being k-colourable.) However, if we keep the assumption of chordality, nice algorithms and characterization theorems are possible. Indeed, our main result is a forbidden subgraph characterization of chordal (k,ℓ)-graphs. We also give an O(n(m+n)) recognition algorithm for chordal (k,ℓ)-graphs. When k=1, our algorithm runs in time O(m+n). In particular, we obtain a new simple and efficient greedy algorithm for the recognition of split graphs, from which it is easy to derive the well known forbidden subgraph characterization of split graphs. The algorithm and the characterization extend, in a natural way, to the ‘list’ (or ‘pre-colouring extension’) version of the split partition problem — given a graph with some vertices pre-assigned to the independent set, or to the clique, is there a split partition extending this pre-assignment? Another way to think of our main result is the following min-max property of chordal graphs: the maximum number of independent (i.e., disjoint and nonadjacent) Kr's equals the minimum number of cliques that meet all Kr's.
Keywords: Chordal graphs
Split graphs
Greedy algorithms
List partitions
Min-max theorems
Grafos cordal
Grafos clique
Department : Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
In: Relatório Técnico NCE
Issue: 0501
Issue Date: 31-Dec-2001
Publisher country: Brasil
Language: eng
Right access: Acesso Aberto
Citation: HELL, P. et al. Partitioning chordal graphs into independent sets and cliques. Rio de Janeiro: NCE/UFRJ, 2001. (Relatório Técnico, 05/01)
Appears in Collections:Relatórios Técnicos e de Pesquisa

Files in This Item:
File Description SizeFormat 
05_01_000613094.pdf726,43 kBAdobe PDFView/Open

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