On clique graphs with linear size

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Protti, Fábio	-
dc.contributor.author	Szwarcfiter, Jayme Luiz	-
dc.date.accessioned	2017-08-15T13:36:04Z	-
dc.date.available	2023-12-21T03:00:51Z	-
dc.date.issued	1999-12-31	-
dc.identifier.citation	PROTTI, F.; SZWARCFITER, J. L. On clique graphs with linear size . Rio de Janeiro: NCE, UFRJ, 1999. 10 p. (Relatório Técnico, 07/99)	pt_BR
dc.identifier.uri	http://hdl.handle.net/11422/2650	-
dc.description.abstract	The clique graph H = K (G) of is the intersection graph of the collection of maximal cliques of G. In this case, G is a clique-inverse graph of H. By examining K (G), we describe some sufficient conditions for the number of maximal cliques of G to be bounded by O(\|VG\|). These conditions are then applied to analyze the complexity of recognizing clique-inverse graphs of various families of graphs.	en
dc.language	eng	pt_BR
dc.relation.ispartof	Relatório Técnico NCE	pt_BR
dc.rights	Acesso Aberto	pt_BR
dc.subject	Grafos clique-inverse	pt_BR
dc.subject	Interseção de grafos	pt_BR
dc.subject	Clique-inverse graphs	en
dc.subject	Intersection graphs	en
dc.subject	Clique graphs	en
dc.title	On clique graphs with linear size	en
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	pt_BR
dc.citation.issue	0799	pt_BR
dc.embargo.terms	aberto	pt_BR
Appears in Collections:	Relatórios

Files in This Item:

File	Description	Size	Format
07_99_000611268.pdf		210.62 kB	Adobe PDF	View/Open

Pantheon Institutional repository