Please use this identifier to cite or link to this item:
http://hdl.handle.net/11422/2598
Type: | Relatório |
Title: | Clique-inverse graphs of K₃-free and K₄-free graphs |
Author(s)/Inventor(s): | Protti, Fábio Szwarcfiter, Jayme Luiz |
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. |
Keywords: | Grafos clique-inverse Interseção de grafos Grafos clique |
Subject CNPq: | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::MATEMATICA DA COMPUTACAO |
Production unit: | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais |
In: | Relatório Técnico NCE |
Issue: | 0599 |
Issue Date: | 31-Dec-1999 |
Publisher country: | Brasil |
Language: | eng |
Right access: | Acesso Aberto |
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) |
Appears in Collections: | Relatórios |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.