Helly EPT graphs on bounded degree trees : Characterization and recognition
The edge-intersection graph of a family of paths on a host tree is called an <i>EPT</i> graph. When the tree has maximum degree h, we say that the graph is [<i>h</i>, 2, 2]. If, in addition, the family of paths satisfies the Helly property, then the graph is Helly [<i>h...
Guardado en:
| Autores principales: | Alcón, Liliana Graciela, Gutiérrez, Marisa, Mazzoleni, María Pía |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/102919 https://www.sciencedirect.com/science/article/abs/pii/S0012365X17302571?via%3Dihub |
| Aporte de: |
Ejemplares similares
-
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) -
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) -
Strong cliques and equistability of EPT graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2016)