End simplicial vertices in path graphs
A graph is a path graph if there is a tree, called UV-model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree. A graph is an interval graph if there is a UV-model that is a path, called an in...
Guardado en:
| Autores principales: | Gutiérrez, Marisa, Tondato, Silvia Beatriz |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2016
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/87295 |
| 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) -
Introducing subclasses of basic chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2013) -
Comparing trees characteristic to chordal and dually chordal graphs
por: De Caria, Pablo Jesús, et al.
Publicado: (2011) -
On Models of Directed Path Graphs Non Rooted Directed Path Graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2016) -
Asteroidal quadruples in non rooted path graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2015)