Chordal (1,l)- and (k,1)- graphs

Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/2573

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hell, Pavol	-
dc.contributor.author	Klein, Sulamita	-
dc.contributor.author	Protti, Fábio	-
dc.contributor.author	Tito, Loana	-
dc.date.accessioned	2017-08-03T15:06:32Z	-
dc.date.available	2023-12-21T03:03:24Z	-
dc.date.issued	2000-12-31	-
dc.identifier.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).	pt_BR
dc.identifier.uri	http://hdl.handle.net/11422/2573	-
dc.description.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.	pt_BR
dc.language	eng	pt_BR
dc.relation.ispartof	Relatório Técnico NCE	pt_BR
dc.rights	Acesso Aberto	pt_BR
dc.subject	Grafos cordal	pt_BR
dc.subject	Teoria dos grafos	pt_BR
dc.subject	Chordal graphs	en
dc.subject	Graphs	en
dc.title	Chordal (1,l)- and (k,1)- graphs	pt_BR
dc.type	Relatório	pt_BR
dc.publisher.country	Brasil	pt_BR
dc.publisher.department	Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais	pt_BR
dc.subject.cnpq	CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO	pt_BR
dc.citation.issue	0600	pt_BR
dc.embargo.terms	aberto	pt_BR
Appears in Collections:	Relatórios

Files in This Item:

File	Description	Size	Format
06_00_000612778.pdf		569.32 kB	Adobe PDF	View/Open

Pantheon Institutional repository