Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
An undirected 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 admit a VPT representation in a host tree with maximum degree at most h is denoted by [h,2,1]. The classes [h,2,1] are closed under taking induced subgraphs, t...
Guardado en:
| Autores principales: | Alcón, Liliana Graciela, Gutiérrez, Marisa, Mazzoleni, María Pía |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2015
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/85830 |
| Aporte de: |
Ejemplares similares
-
Recognizing vertex intersection graphs of paths on bounded degree trees
por: Alcón, Liliana Graciela, et al.
Publicado: (2014) -
EPT graphs 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) -
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
por: Alcón, L., et al. -
Vertex intersection graphs of paths on a grid: characterization within block graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2017)