Comparing trees characteristic to chordal and dually chordal graphs
Chordal and dually chordal graphs possess characteristic tree representations, namely, clique trees and compatible trees, respectively. The following problem is studied: given a chordal graph G, it has to be determined if the clique trees of G are exactly the compatible trees of K(G). This does not...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/95040 |
| Acceso en línea: | http://hdl.handle.net/11336/95040 |
| Access Level: | acceso abierto |
| Palabra clave: | CHORDAL DUALLY CHORDAL CLIQUE TREE COMPATIBLE TREE https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Sumario: | Chordal and dually chordal graphs possess characteristic tree representations, namely, clique trees and compatible trees, respectively. The following problem is studied: given a chordal graph G, it has to be determined if the clique trees of G are exactly the compatible trees of K(G). This does not always happen. A necessary and sufficient condition so that it is true, in terms of the minimal vertex separators of the graph, is found. |
|---|