EPT graphs on bounded degree trees
An undirected graph Gis called an EPT graphif it is the edge intersection graph of a family of paths in a tree. In this paper, we answer negatively the question posed by Golumbic et al. [4]: Canany EPT graph without induced cycles of size greater than h be represented in a host tree with maximum deg...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/101645 https://ri.conicet.gov.ar/11336/32783 http://mc.sbm.org.br/docs/mc/pdf/42/a1.pdf |
| Aporte de: |
| Sumario: | An undirected graph Gis called an EPT graphif it is the edge intersection graph of a family of paths in a tree. In this paper, we answer negatively the question posed by Golumbic et al. [4]: Canany EPT graph without induced cycles of size greater than h be represented in a host tree with maximum degree h? |
|---|