Clique-inverse graphs of K₃-free and K₄-free graphs

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Protti, Fábio	-
dc.contributor.author	Szwarcfiter, Jayme Luiz	-
dc.date.accessioned	2017-08-04T13:30:02Z	-
dc.date.available	2023-12-21T03:03:27Z	-
dc.date.issued	1999-12-31	-
dc.identifier.citation	PROTTI, F.; SZWARCFITER, J. L. Clique-inverse graphs of K3-free and K4-free graphs . Rio de Janeiro: NCE, UFRJ, 1999. 23 p. (Relatório Técnico, 05/99)	pt_BR
dc.identifier.uri	http://hdl.handle.net/11422/2598	-
dc.description.abstract	The clique K (G) of a given graph G is the intersection graph of the collection of maximal cliques of G. Given a family F of graphs, the clique-inverse graphs of F are the graphswhose clique graphs belong to F. in this work, we describe characterizations for clique-inverse graphs of K₃-free and K₄-free graphs. The characterizations are formulated in terms of forbidden subgraphs.	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	Grafos clique	pt_BR
dc.title	Clique-inverse graphs of K₃-free and K₄-free graphs	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::MATEMATICA DA COMPUTACAO	pt_BR
dc.citation.issue	0599	pt_BR
dc.embargo.terms	aberto	pt_BR
Appears in Collections:	Relatórios

Files in This Item:

File	Description	Size	Format
05_99.pdf		213.81 kB	Adobe PDF	View/Open

Pantheon Institutional repository