Recognizing vertex intersection graphs of paths on bounded degree trees
An (h,s,t)-representation of a graph G consists of a collection of subtrees of a tree T, where each subtree corresponds to a vertex of G such that (i) the maximum degree of T is at most h, (ii) every subtree has maximum degree at most s, (iii) there is an edge between two vertices in the graph G if...
Guardado en:
| Autores principales: | Alcón, Liliana Graciela, Gutiérrez, Marisa, Mazzoleni, María Pía |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2014
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/85561 |
| 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) -
EPT graphs on bounded degree trees
por: Alcón, Liliana Graciela, et al.
Publicado: (2014) -
Helly EPT graphs on bounded degree trees : Characterization and recognition
por: Alcón, Liliana Graciela, et al.
Publicado: (2017) -
Families of induced trees and their intersection graphs
por: De Caria, Pablo Jesús
Publicado: (2019) -
Vertex intersection graphs of paths on a grid: characterization within block graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2017)