Maxclique and unit disk characterizationsof 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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| 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/32705 |
| Acceso en línea: | http://hdl.handle.net/11336/32705 |
| Access Level: | acceso abierto |
| Palabra clave: | CHORDAL GRAPH STRONGLY CHORDAL GRAPH MAXCLIQUE CLOSED NEIGHBORHOOD CLIQUE https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Sumario: | 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 characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly chordal graphs. |
|---|