A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
An undirected graph G is called an EPT graph if it is the edge intersection graph of a family of paths in a tree. In this paper we de ne the concept of satellite of a clique and we give a necessary condition to be an EPT graph based on satellites of cliques. We characterize the minimal graphs which...
Guardado en:
| Autores principales: | Alcón, Liliana Graciela, Gutiérrez, Marisa, Mazzoleni, María Pía |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2010
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/164530 |
| Aporte de: |
Ejemplares similares
-
EPT graphs on bounded degree trees
por: Alcón, Liliana Graciela, et al.
Publicado: (2014) -
Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2015) -
Helly EPT graphs on bounded degree trees : Characterization and recognition
por: Alcón, Liliana Graciela, et al.
Publicado: (2017) -
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)