On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Golumbic, Lipshteyn and Stern [12] proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a rectangular grid such that two vertices are adjacent if and only if the correspond...
Guardado en:
| Autores principales: | Alcón, Liliana Graciela, Bonomo, Flavia, Duran, Guillermo Alfredo, Gutiérrez, Marisa, Mazzoleni, María Pía, Ries, Bernard, Valencia-Pabon, Mario |
|---|---|
| Formato: | Articulo Preprint |
| Lenguaje: | Inglés |
| Publicado: |
2018
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/95480 https://ri.conicet.gov.ar/11336/83118 https://arxiv.org/abs/1506.08750 |
| Aporte de: |
Ejemplares similares
-
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
por: Alcón, L., et al. -
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
por: Bonomo, Flavia, et al.
Publicado: (2015) -
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
por: Alcón, L., et al. -
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
por: Bonomo, Flavia, et al.
Publicado: (2018) -
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs
por: Alcón, L., et al.