| dc.creator | Protti, Fábio | |
| dc.creator | Szwarcfiter, Jayme Luiz | |
| dc.date | 2017-08-15T13:36:04Z | |
| dc.date | 2023-09-27T03:01:27Z | |
| dc.date | 1999-12-31 | |
| dc.date.accessioned | 2023-09-27T13:09:55Z | |
| dc.date.available | 2023-09-27T13:09:55Z | |
| dc.identifier | 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) | |
| dc.identifier | http://hdl.handle.net/11422/2650 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8902284 | |
| dc.description | 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. | |
| dc.language | eng | |
| dc.publisher | Brasil | |
| dc.publisher | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais | |
| dc.relation | Relatório Técnico NCE | |
| dc.rights | Acesso Aberto | |
| dc.subject | Grafos clique-inverse | |
| dc.subject | Interseção de grafos | |
| dc.subject | Clique-inverse graphs | |
| dc.subject | Intersection graphs | |
| dc.subject | Clique graphs | |
| dc.subject | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO | |
| dc.title | On clique graphs with linear size | |
| dc.type | Relatório | |
