Determining what sets of trees can be the clique trees of a chordal graph
Chordal graphs have characteristic tree representations, the clique trees. The problems of finding one or enumerating them have already been solved in a satisfactory way. In this paper, the following related problem is studied: given a family T of trees, all having the same vertex set V, determine w...
Guardado en:
| Autores principales: | De Caria, Pablo Jesús, Gutiérrez, Marisa |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2011
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/97141 https://ri.conicet.gov.ar/11336/81353 http://link.springer.com/article/10.1007%2Fs13173-011-0048-0 |
| Aporte de: |
Ejemplares similares
-
On the correspondence between tree representations of chordal and dually chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2014) -
Comparing trees characteristic to chordal and dually chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2011) -
Determining possible sets of leaves for spanning trees of dually chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2009) -
Introducing subclasses of basic chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2013) -
On minimal vertex separators of dually chordal graphs: properties and characterizations
por: De Caria, Pablo Jesús, et al.
Publicado: (2012)