Please use this identifier to cite or link to this item: http://hdl.handle.net/11422/2717
Type: Relatório
Title: Clique-inverse graphs of bipartite graphs
Author(s)/Inventor(s): Protti, Fábio
Szwarcfiter, Jayme Luiz
Abstract: The clique graph K (G) of a given graph of the collection of maximal cliques of G. Given a family F of graphs, the clique-inverse graphs of F are the graphs whose clique graphs belong to F. In this work, we describes a characterizations for clique-inverse graphs of bipartite graphs, chordal bipartite graphs, and trees. The characterizations lead to polinomial time algorithms for the corresponding recognition problems.
Keywords: Interseção de grafos
Grafos clique-inverse
Grafos clique
Intersection graphs
Clique graphs
Clique-inverse graphs
Subject CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO
Department : Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais
In: Relatório Técnico NCE
Issue: 2299
Issue Date: 31-Dec-2004
Publisher country: Brasil
Language: eng
Right access: Acesso Aberto
Citation: PROTTI, F; SZWARCFITER, J. L. Clique-inverse graphs of bipartite graphs. Rio de Janeiro: NCE, UFRJ, 1999. 13 p. (Relatório Técnico, 22/99)
Appears in Collections:Relatórios Técnicos e de Pesquisa

Files in This Item:
File Description SizeFormat 
22_99_000611343.pdf187,45 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.