Maxclique and unit disk characterizations of strongly chordal graphs
Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these chara...
Guardado en:
| Autores principales: | De Caria, Pablo Jesús, McKee, Terry A. |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/85203 |
| 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) -
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) -
Determining what sets of trees can be the clique trees of a chordal graph
por: De Caria, Pablo Jesús, et al.
Publicado: (2011)