On minimal non [h, 2, 1] graphs
A graph G is called a VPT graph if it is the vertex intersection graph of a family of paths in a tree. The class of graphs which admits a VPT representation in a host tree with maximum degree at most h is denoted by [h,2,1]. In [3], it is shown that the problem of recognizing V PT graphs is polynomi...
Guardado en:
| Autores principales: | Alcón, Liliana Graciela, Gutiérrez, Marisa, Mazzoleni, María Pía |
|---|---|
| Formato: | Objeto de conferencia Resumen |
| Lenguaje: | Inglés |
| Publicado: |
2013
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/94540 |
| Aporte de: |
Ejemplares similares
-
Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2015) -
Recognizing vertex intersection graphs of paths on bounded degree trees
por: Alcón, Liliana Graciela, et al.
Publicado: (2014) -
A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2010) -
Helly EPT graphs on bounded degree trees : Characterization and recognition
por: Alcón, Liliana Graciela, et al.
Publicado: (2017) -
EPT graphs on bounded degree trees
por: Alcón, Liliana Graciela, et al.
Publicado: (2014)