Clique graphs of chordal and path graphs
We characterize clique graphs of chordal and path graphs. A special class of graphs called expanded trees is introduced. They form a subclass of disk-Helly graphs. It is shown that the clique graph of every chordal (hence path) graph is an expanded tree. In addition, every expanded tree is the cliqu...
| Autores: | , |
|---|---|
| Formato: | informe técnico |
| Estado: | Versión publicada |
| Fecha de publicación: | 1991 |
| País: | Brasil |
| Recursos: | Universidade Federal do Rio de Janeiro (UFRJ) |
| Repositorio: | Repositório Institucional da UFRJ |
| Idioma: | inglés |
| OAI Identifier: | oai:pantheon.ufrj.br:11422/1497 |
| Acesso em linha: | http://hdl.handle.net/11422/1497 |
| Access Level: | acceso abierto |
| Palavra-chave: | Grafos cordal Algoritmos CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
| Resumo: | We characterize clique graphs of chordal and path graphs. A special class of graphs called expanded trees is introduced. They form a subclass of disk-Helly graphs. It is shown that the clique graph of every chordal (hence path) graph is an expanded tree. In addition, every expanded tree is the clique graph of some path (hence chordal) graph. Different characterizations of expanded trees are described, leading to a polynomial time algorithm for recognizing clique graphs of chordal and path graphs. |
|---|