On the correspondence between tree representations of chordal and dually chordal graphs
Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively. The following problem is studied: given a chordal graph G, determine if the clique trees of G are exactly the compatible t...
Guardado en:
| Autores principales: | De Caria, Pablo Jesús, Gutiérrez, Marisa |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/85139 |
| Aporte de: |
Ejemplares similares
Ejemplares similares
-
Comparing trees characteristic to chordal and dually chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2011) -
Introducing subclasses of basic chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2013) -
Determining possible sets of leaves for spanning trees of dually chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2009) -
On minimal vertex separators of dually chordal graphs: properties and characterizations
por: De Caria, Pablo Jesús, et al.
Publicado: (2012) -
Minimal vertex separators and new characterizations for dually chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2009)