Recognizing clique graphs of directed edge path graphs
Directed edge path graphs are the intersection graphs of directed paths in a directed tree, viewed as sets of edges. They were studied by Monma and Wei (J. Comb. Theory B 41 (1986) 141-181) who also gave a polynomial time recognition algorithm. In this work, we show that the clique graphs of these g...
Guardado en:
| Autores principales: | Gutiérrez, Marisa, Meidanis, João |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2003
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/83487 |
| Aporte de: |
Ejemplares similares
-
The difference between clique graphs and iterated clique graphs
por: De Caria, Pablo Jesús
Publicado: (2011) -
The complexity of clique graph recognition
por: Alcón, Liliana Graciela, et al.
Publicado: (2009) -
On clique‐inverse graphs of graphs with bounded clique number
por: Alcón, Liliana Graciela, et al.
Publicado: (2020) -
On split clique graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2010) -
On clique-perfect and K-perfect graphs
por: Bonomo, F., et al.