Please use this identifier to cite or link to this item:
http://hdl.handle.net/11422/2573
Type: | Relatório |
Title: | Chordal (1,l)- and (k,1)- graphs |
Author(s)/Inventor(s): | Hell, Pavol Klein, Sulamita Protti, Fábio Tito, Loana |
Abstract: | A graph is said to be a (k, l)-graph if its vertex set can be partitioned into k independent sets and 1 cliques. The class of (k, l)-graphs appears as a natural generalization of split graphs. In this work, we characterize chordal (k, 1)- and (1, l)-graphs. |
Keywords: | Grafos cordal Teoria dos grafos Chordal graphs Graphs |
Subject CNPq: | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO |
Production unit: | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais |
In: | Relatório Técnico NCE |
Issue: | 0600 |
Issue Date: | 31-Dec-2000 |
Publisher country: | Brasil |
Language: | eng |
Right access: | Acesso Aberto |
Citation: | HELL, P. et al. Chordal (1, I) - and (k,1)- graphs. Rio de Janeiro: NCE, UFRJ, 2000. 04 p. (Relatório Técnico, 06/00). |
Appears in Collections: | Relatórios |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
06_00_000612778.pdf | 569.32 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.