End vertices in containment interval graphs
An interval containment model of a graph maps vertices into intervals of a line in such a way that two vertices are adjacent if and only if the corresponding intervals are comparable under the inclusion relation. Graphs admitting an interval containment model are called containment interval graphs o...
Guardado en:
| Autores principales: | Alcón, Liliana Graciela, Gudiño, Noemí Amalia, Gutiérrez, Marisa |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/96293 https://ri.conicet.gov.ar/11336/75962 http://mc.sbm.org.br/wp-content/uploads/sites/15/2018/12/45-11.pdf |
| Aporte de: |
Ejemplares similares
-
End simplicial vertices in path graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2016) -
On k-tree Containment Graphs of Paths in a Tree
por: Alcón, Liliana Graciela, et al.
Publicado: (2020) -
Herramientas y tecnologías para el desarrollo web desde el FrontEnd al BackEnd
por: Pérez Ibarra, Susana Graciela, et al.
Publicado: (2021) -
A universal imagination of the end of the world?
Publicado: (2018) -
TOPSIS method integrated into a back-end development for mobile phone selection
por: Peretto, Claudia B., et al.
Publicado: (2021)