Families of induced trees and their intersection graphs
This paper is inspired in the well known characterization of chordal graphs as the intersection graphs of subtrees of a tree. We consider families of induced trees of any graph and we prove that their recognition is NP-Complete. A consequence of this fact is that the concept of clique tree of chorda...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2019 |
| País: | Argentina |
| Institución: | Universidad Nacional de La Plata |
| Repositorio: | SEDICI (UNLP) |
| Idioma: | inglés |
| OAI Identifier: | oai:sedici.unlp.edu.ar:10915/159867 |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/159867 |
| Access Level: | acceso abierto |
| Palabra clave: | Matemática Subtree Intersection Graph Clique Tree Bipartite Graph |
| Sumario: | This paper is inspired in the well known characterization of chordal graphs as the intersection graphs of subtrees of a tree. We consider families of induced trees of any graph and we prove that their recognition is NP-Complete. A consequence of this fact is that the concept of clique tree of chordal graphs cannot be widely generalized. Finally, we consider the fact that every graph is the intersection graph of induced trees of a bipartite graph and we characterize some classes that arise when we impose restrictions on the host bipartite graph. |
|---|